Auswahl der wissenschaftlichen Literatur zum Thema „Minimisation de l'énergie“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Minimisation de l'énergie" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Dissertationen zum Thema "Minimisation de l'énergie"
Vallée, Alexandre. „Construction dynamique de fragments par minimisation de l'énergie libre lors de collisions d'ions lourds“. Thesis, Université Laval, 2009. http://www.theses.ulaval.ca/2009/26638/26638.pdf.
Der volle Inhalt der QuelleFlayac, Serge. „Les géothermomètres du champ géothermique des Antilles : calcul des équilibres géochimiques par minimisation de l'énergie libre“. Poitiers, 1990. http://www.theses.fr/1990POIT2281.
Der volle Inhalt der QuelleNéron, Alex. „Développement d'une plateforme de calcul d'équilibres chimiques complexes et adaptation aux problèmes électrochimiques et d'équilibres contraints“. Mémoire, Université de Sherbrooke, 2012. http://hdl.handle.net/11143/5502.
Der volle Inhalt der QuelleVasquez, Perez Oscar Carlos. „Ordonnancement de tâches pour concilier la minimisation de la consommation d'énergie avec la qualité de service : optimisation et théorie des jeux“. Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066591/document.
Der volle Inhalt der QuelleThis thesis focuses on a job scheduling problem with the goal of minimizing the sum of energy consumption and the weighted flow time from two different approaches: centralized and decentralized. In the decentralized setting, we defined two games which differ in the strategies players can choose from and designed cost sharing mechanisms, charging the consumed energy to the users in order to incentive a socially desirable behavior. More precisely we were interested in the existence of pure Nash equilibria, in the convergence time, and the ratio between the consumed energy and the total charged amount. On the other side, for the centralized approach, we reduced the minimization problem to a classical scheduling problem with a polynomial concave penalty function, for which little results were known. We established a state of the art for a family of scheduling problems of this form with different penalty functions and showed that a classical NP-completeness proof technique fails here. Finally we addressed the exact resolution of the problem using the algorithm A*. In this context, we showed new order dominance rules. More precisely, we characterized the conditions under which any optimal solution must schedule a job pair in a certain order. In addition we carried out a computational experience to evaluate the practical impact of these new rules compared to the existing ones
Vasquez, Perez Oscar Carlos. „Ordonnancement de tâches pour concilier la minimisation de la consommation d'énergie avec la qualité de service : optimisation et théorie des jeux“. Electronic Thesis or Diss., Paris 6, 2014. http://www.theses.fr/2014PA066591.
Der volle Inhalt der QuelleThis thesis focuses on a job scheduling problem with the goal of minimizing the sum of energy consumption and the weighted flow time from two different approaches: centralized and decentralized. In the decentralized setting, we defined two games which differ in the strategies players can choose from and designed cost sharing mechanisms, charging the consumed energy to the users in order to incentive a socially desirable behavior. More precisely we were interested in the existence of pure Nash equilibria, in the convergence time, and the ratio between the consumed energy and the total charged amount. On the other side, for the centralized approach, we reduced the minimization problem to a classical scheduling problem with a polynomial concave penalty function, for which little results were known. We established a state of the art for a family of scheduling problems of this form with different penalty functions and showed that a classical NP-completeness proof technique fails here. Finally we addressed the exact resolution of the problem using the algorithm A*. In this context, we showed new order dominance rules. More precisely, we characterized the conditions under which any optimal solution must schedule a job pair in a certain order. In addition we carried out a computational experience to evaluate the practical impact of these new rules compared to the existing ones
Soueid, Salwa. „Micromagnétismes des films minces“. Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1037/document.
Der volle Inhalt der QuelleThe ferromagnetic materials possess the magnetic property of future, that is to magnetize, when they are in the presence of a magnetic field and to keep a part of their magnetizing when the field is deleted. It is for that reason, these materials became of use in numerous industrial applications (...)
Gmira, Ahmed. „Etude structurale et thermodynamique d'hydrates modèle du ciment“. Phd thesis, Université d'Orléans, 2003. http://tel.archives-ouvertes.fr/tel-00006001.
Der volle Inhalt der QuelleDogeas, Konstantinos. „Energy Minimization, Data Movement and Uncertainty : Models and Algorithms“. Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS070.pdf.
Der volle Inhalt der QuelleHigh performance computers (HPCs) is the go-to solution for running computationally demanding applications. As the limit of energy consumption is already achieved, the need for more energy efficient algorithms is critical.Taking advantage of the core characteristics of an HPC, such as its network topology and the heterogeneity of the machines, could lead to better scheduling algorithms. In addition, designing more realistic models, that grasp the features of real-life applications, is a work in the same direction of achieving better performance. Allowing scheduling algorithms to decide either the amount of resources allocated to an application or the running speed of the resources can pave the path to new platform-aware implementations. In the first part of the thesis, we introduce a model which takes into account both the topology and the heterogeneity of a platform by introducing two kind of machines. We augment the scheduling problem with constraints whose purpose is to implicitly reduce data movement either during parallel execution or during the communication with the file system. We propose algorithms that can decide the number of resources allocated to an application taking into consideration the extra constraints.In the second part of the thesis, we deal with the uncertainty on part of the input and more specifically, the workload of an application, that is strictly related to the time needed for its completion. Most works in the literature consider this value known in advance. However, this is rarely the case in real-life systems.In our approach, the given workload is a worst case scenario for the execution of an application. We introduce application-specific tests that may decrease the workload of a task.Since the test (e.g. compression) takes some time, and since the amount of reduction (e.g. in size) is unknown before the completion of the test, the decision of running the test for a task or not has to be taken. We propose competitive algorithms for the problem of scheduling such tasks, in order to minimize the energy consumed in a set of speed-adjustable machines. In the third part of the thesis, we focus on a similar setting of uncertain input and we consider a model where the processing times are not known in advance. Here, we augment the input of the problem by introducing predicted values in place of the unknown processing times. We design algorithms that perform optimally when the predictions are accurate while remaining competitive to the best known ones otherwise
Berrouche, Khoumissa. „LES DIPOLES REACTIFS MODULES ET LA GESTION DE L'ENERGIE REACTIVE DANS LES CONVERTISSEURS A DECOUPAGE“. Phd thesis, 2000. http://tel.archives-ouvertes.fr/tel-00688653.
Der volle Inhalt der Quelle