Auswahl der wissenschaftlichen Literatur zum Thema „Optimisation efficace“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Optimisation efficace" 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.
Zeitschriftenartikel zum Thema "Optimisation efficace":
Chouba, I., T. Arbaoui, L. Amodeo, F. Yalaoui, P. Blua, S. Sanchez und D. Laplanche. „Optimisation du service d’urgences à l’aide d’un modèle de simulation efficace“. Revue d'Épidémiologie et de Santé Publique 67 (März 2019): S86. http://dx.doi.org/10.1016/j.respe.2019.01.044.
Touil, Salah. „Optimisation du traitement physico-chimique des eaux d’encres“. Journal of Renewable Energies 20, Nr. 3 (30.09.2017): 415–22. http://dx.doi.org/10.54966/jreen.v20i3.637.
Duclos-Prévet, Claire, François Guéna und Mariano Efron. „Algorithme génétique ou automate cellulaire : le cas d’une optimisation multicritère sous contraintes pour la conception d’une enveloppe“. SHS Web of Conferences 147 (2022): 09001. http://dx.doi.org/10.1051/shsconf/202214709001.
Raissouni, Rajaa, M’hamed Hamiche, Salmane Bourekkadi und Kenza Raissouni. „Optimisation des performances opérationnelles de l’industrie automobile électrique marocaine grâce à une intégration efficace de la chaîne logistique“. SHS Web of Conferences 175 (2023): 01027. http://dx.doi.org/10.1051/shsconf/202317501027.
Carrié, Cédric, Noémie Sauvage und Matthieu Biais. „Optimisation du traitement par β-Lactamines chez le patient de réanimation en hyperclairance rénale“. Médecine Intensive Réanimation 30, Nr. 2 (18.05.2021): 157–64. http://dx.doi.org/10.37051/mir-00059.
CHEVALET, C., und D. BOICHARD. „Sélection assistée par marqueurs“. INRAE Productions Animales 5, HS (02.12.1992): 291–94. http://dx.doi.org/10.20870/productions-animales.1992.5.hs.4307.
Bolte, Michele, und Michel Troquet. „Optimisation de la caracterisation de polymeres hydrosolubles par chromatographie a permeation de gel: Utilisation de plans d'experiences, une methode rapide et efficace“. European Polymer Journal 26, Nr. 2 (Januar 1990): 177–79. http://dx.doi.org/10.1016/0014-3057(90)90184-6.
GUEGUEN, N., L. LEFAUCHEUR und P. HERPIN. „Relations entre fonctionnement mitochondrial et types contractiles des fibres musculaires“. INRAE Productions Animales 19, Nr. 4 (13.09.2006): 265–78. http://dx.doi.org/10.20870/productions-animales.2006.19.4.3494.
Ie, Kenya, Masanori Hirose, Tsubasa Sakai, Iori Motohashi, Mari Aihara, Takuya Otsuki, Ayako Tsuboya et al. „Protocol of a randomised controlled trial on the efficacy of medication optimisation in elderly inpatients: medication optimisation protocol efficacy for geriatric inpatients (MPEG) trial“. BMJ Open 10, Nr. 10 (Oktober 2020): e041125. http://dx.doi.org/10.1136/bmjopen-2020-041125.
Frederick Uzoma Etumnu, Ipeghan Jonathan Otaraku, Matthew Idemudia Ehikhamenle und Bourdillon Odianonsen Omijeh. „Optimisation of liquefied natural gas production: genetic algorithm and custom-developed method“. Global Journal of Engineering and Technology Advances 17, Nr. 2 (30.11.2023): 031–39. http://dx.doi.org/10.30574/gjeta.2023.17.2.0223.
Dissertationen zum Thema "Optimisation efficace":
Hamdar, Marian. „Conception et optimisation d'un système indirect efficace de climatisation ferroviaire“. Paris, ENMP, 2008. http://www.theses.fr/2008ENMP1693.
Davot, Tom. „A la recherche de l’échafaudage parfait : efficace, de qualité et garanti“. Thesis, Montpellier, 2020. http://www.theses.fr/2020MONTS030.
Sequencing is a process in biology that determines the order of nucleotides in the DNA. It produces a set of fragments, called reads, in which the genetic information is known. Unfortunatly, the genomic sequence is decomposed in small pieces. In order to analyse it, it is necessary to reconstruct it using a number of computer processes. In this thesis, we studied two mathematical problems arising from this sequencing: the scaffolding and the linearization.The scaffolding is a process that takes place after the reads assembly into larger subsequences called contigs. It consists in the search of paths and cycles in a particular graph called scaffold graph. These paths and cycles represent the linear and circular chromosomes of the organism whose DNA has been sequenced. The linearization is a problem related to the scaffolding. When we take into account that contigs may appear several times in the genomic sequence, some ambiguities can arise. If this ambiguities are not deleted, then a chimeric sequence may be produced by the scaffolding. To solve this problem, a solution computed by the scaffolding should be wisely deteriorated. In any case, both problems can be modelized as optimization problems in a graph.In this document, we study both problems focusing on three aspects. The first aspect consists in the study of the complexity of these problems. The second aspect consists in the development of algorithms, exact or approximate, to solve these problems. Finally, the last aspect consists in implementing and testing these algorithms to look at their behaviors on real instances
Tap, Samuel. „Construction de nouveaux outils de chiffrement homomorphe efficace“. Electronic Thesis or Diss., Université de Rennes (2023-....), 2023. http://www.theses.fr/2023URENS103.
In our everyday life, we leave a trail of data whenever we access online services. Some are given voluntarily and others reluctantly. Those data are collected and analyzed in the clear which leads to major threats on the user's privacy and prevents collaborations between entities working on sensitive data. In this context, Fully Homomorphic Encryption brings a new hope by enabling computation over encrypted data, which removes the need to access data in the clear to analyze and exploit it. This thesis focuses on TFHE, a recent fully homomorphic encryption scheme able to compute a bootstrapping in record time. We introduce an optimization framework to set the degrees of freedom inherent to homomorphic computations which gives non-experts the ability to use it (more) easily. We describe a plethora of new FHE algorithms which improve significantly the state of the art and limit, (if not remove) existing restrictions. Efficient open source implementations are already accessible
Potop-Butucaru, Dumitru. „Optimisations pour la simulation efficace de programmes Esterel“. Paris, ENMP, 2002. http://www.theses.fr/2002ENMP0002.
Esterel is a design language for reactive embedded systems. It enjoys a full-fledged formal operational semantics, and can customarily be compiled into either explicit Finite State Machines or Digital Sequential Circuit models, thereby providing implementation codes with very distinctive flavors. While being semantically complete, the model-based techniques do not support the generation of efficient (fast and small) code for large specifications. For this reason, new compilation schemes were proposed for the generation of efficient sequential ( C) code. Consisting essentially in direct actual simulation of the language reactive features, the new approach now needs to be accommodated with similar semantic issues as the previous ones (FSM- and circuit-based). Such issues include dealing with the whole class of constructively causal programs, or performing optimization and analysis of this level. To this end, we propose here a new format/model (named GRC) for the intermediate representation of Esterel programs. The new format has formal constructive semantics, being able to represent all the Esterel programs. It describes with separate (but interdependent) structures the hierarchic state of the Esterel program and its destructured control flow. Thus, it is a good support for both (1) efficient low-cost optimizations based on static analysis that use high-level structural information and (2) low-level control flow optimizations. Finally, the format is a good starting point for efficient scheduling algorithms. Our contribution consists in the following : - The precise definition of the semantics of the full Esterel language ; - The definition of the GRC format (including the formal correspondence between its semantics and the “circuit” semantics) ; - A characterization, at GRC level, of the programs that are translated into cyclic circuits ; - The development of an optimizing GRC-based prototype C code generator. The prototype is currently able to compile the programs whose GRC representation is acyclic. Sequential code is generated in these cases by statically scheduling the acyclic GRC flowgraph. The compiler includes novel optimization algorithms, based on static analysis, and an efficient state encoding technique. The results are encouraging, as our prototype seems to compare well against existing compilers
Hasan, Cengis. „Optimisation de l'allocation de ressources dans les réseaux celluaires : une approche efficace en énergie“. Phd thesis, INSA de Lyon, 2013. http://tel.archives-ouvertes.fr/tel-00942967.
Gougeon, Adrien. „Optimisation d’un réseau dynamique et efficace en énergie servant à piloter la grille électrique“. Electronic Thesis or Diss., Université de Rennes (2023-....), 2023. https://tel.archives-ouvertes.fr/tel-04086397.
In front of the challenges concerning the energy and environmental sectors, the electrical grid faces some limitations. A major issue of the current power network is the lack of communication and coordination between its actors to fully exploit its potential.To overcome those limitations, and offer new services to the actors of the electrical grid, we are moving toward the Smart Grid. The deployment of an additional infrastructure is necessary to enable the Smart Grid. This infrastructure, known as the Advanced Metering Infrastructure (AMI), aims to enhance the monitoring and communication capabilities of the actors of the electrical grid.The goal of this thesis is to quantify the performance degradation of some new services of the Smart Grid, due to the quality of service of the AMI. We explore several parameters of the communication infrastructure and observe through co-simulation how those parameters influence the efficiency of those services. One of the main objectives of the Smart Grid is to reduce energy consumption.In a second stage, we model the end-to-end energy consumption of an AMI at a large scale to assess its own consumption.The proposed co-simulation framework and consumption models are all license free
Villemonteix, Julien. „Optimisation de fonctions coûteusesModèles gaussiens pour une utilisation efficace du budget d'évaluations : théorie et pratique industrielle“. Phd thesis, Université Paris Sud - Paris XI, 2008. http://tel.archives-ouvertes.fr/tel-00351406.
en ingénierie. Comment optimiser une fonction lorsque le nombre d'évaluations autorisé est très limité au regard de la dimension et de la complexité du problème ? Par exemple, lorsque le budget d'évaluations est limité par la durée des simulations numériques du système à optimiser, il n'est pas rare de devoir optimiser trente paramètres avec moins
de cent évaluations. Ce travail traite d'algorithmes d'optimisation spécifiques à ce contexte pour lequel la plupart des méthodes classiques sont inadaptées.
Le principe commun aux méthodes proposées est d'exploiter les propriétés des processus gaussiens et du krigeage pour construire une approximation peu coûteuse de la fonction à optimiser. Cette approximation est ensuite utilisée pour choisir itérativement les évaluations à réaliser. Ce choix est dicté par un critère d'échantillonnage qui combine recherche locale, à proximité des résultats prometteurs, et recherche globale, dans les zones non explorées. La plupart des critères proposés dans la littérature, tel celui de l'algorithme EGO (pour Efficient Global Optimization), cherchent à échantillonner la fonction là où l'apparition d'un optimum est jugée la plus probable. En comparaison, l'algorithme IAGO (pour Informational Approach to Global Optimization), principale contribution de nos travaux, cherche à maximiser la quantité d'information apportée, sur la position de l'optimum, par l'évaluation réalisée. Des problématiques industrielles ont guidé l'organisation de ce mémoire, qui se destine à la communauté de l'optimisation
tout comme aux praticiens confrontés à des fonctions à l'évaluation coûteuse. Aussi les applications industrielles y tiennent-elles une place importante tout comme la mise en place de l'algorithme IAGO. Nous détaillons non seulement le cas standard de l'optimisation d'une fonction réelle, mais aussi la prise en compte de contraintes, de
bruit sur les résultats des évaluations, de résultats d'évaluation du gradient, de problèmes multi-objectifs, ou encore d'incertitudes de fabrication significatives.
Mezmaz, Mohand. „Une approche efficace pour le passage sur grilles de calcul de méthodes d'optimisation combinatoire“. Lille 1, 2007. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/2007/50376-2007-Mezmaz.pdf.
The exact resolution of large combinatorial optimization problems is a challenge for grids. Indeed, it is necessary to rethink the resolution algorithms to take into account the characteristics of such environments, in particular their large-scale, the heterogeneity and the dynamic availability of their resources, and their multi-domain administration. Ln this thesis, we propose a new approach, called B&B@Grid, to adapt exact methods for grids. This approach is based on coding work units in the form of intervals in order to minimize the cost of communications caused by the operations of load balancing, fault tolerance and detection of termination. This approach, about 100 times more efficient than the best known approach in term of communication cost, led to the optimal resolution on the Grid5000 of a standard instance of the Flow-Shop problem remained unsolved for fifteen years. To accelerate the resolution, we also deal with cooperation on the grid of exact methods with meta-heuristics. Two cooperation modes have been considered: the relay mode where a meta-heuristic is performed before an exact method, and the co-evolutionary mode where both methods are executed in parallel. The implementation of this cooperation on a grid has led us to propose an extension of the Linda coordination model
Griset, Rodolphe. „Méthodes pour la résolution efficace de très grands problèmes combinatoires stochastiques : application à un problème industriel d'EDF“. Thesis, Bordeaux, 2018. http://www.theses.fr/2018BORD0219/document.
The purpose of this Ph.D. thesis is to study optimization techniques for large-scale stochastic combinatorial problems. We apply those techniques to the problem of scheduling EDF nuclear power plant maintenance outages, which is of significant importance due to the major part of the nuclear energy in the French electricity system. We build on a two-stages extended formulation, the first level of which fixes nuclear outage dates and production profiles for nuclear plants, while the second evaluates the cost to meet the demand. This formulation enables the solving of deterministic industrial instances to optimality, by using a MIP solver. However, the computational time increases significantly with the number of scenarios. Hence, we resort to a procedure combining column generation of a Dantzig-Wolfe decomposition with Benders’ cut generation, to account for the linear relaxation of stochastic instances. We then obtain integer solutions of good quality via a heuristic, up to fifty scenarios. We further assume that outage durations are uncertain and that unexpected shutdowns of plants may occur. We investigate robust optimization methods in this context while ignoring possible recourse on power plants outage dates. We report on several approaches, which use bi-objective or probabilistic methods, to ensure the satisfaction of constraints which might be relaxed in the operating process. For other constraints, we apply a budget uncertainty-based approach to limit future re-organizations of the scheduling. Adding probabilistic information leads to better control of the price of the robustness
Tran, Khanh Toan. „Déploiement efficace de services complexes dans l'infrastructure de cloud“. Phd thesis, Université d'Evry-Val d'Essonne, 2013. http://tel.archives-ouvertes.fr/tel-00875818.
Buchteile zum Thema "Optimisation efficace":
Anbu, Deepika, Alistair Robson, Octavia Kurn, Charles Taylor, Oliver Dean, December Payne, Eva Nagy, Charlotte Harrison, Samuel Hall und Scott Border. „Evaluating the Efficacy and Optimisation of the Peer-Led Flipped Model Using TEL Resources Within Neuroanatomy“. In Advances in Experimental Medicine and Biology, 1–22. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-76951-2_1.
Arzmi, Mohd Hafiz, Anwar P. P. Abdul Majeed, Rabiu Muazu Musa, Mohd Azraai Mohd Razman, Hong-Seng Gan, Ismail Mohd Khairuddin und Ahmad Fakhri Ab. Nasir. „The Classification of Breast Cancer: The Effect of Hyperparameter Optimisation Towards the Efficacy of Feature-Based Transfer Learning Pipeline“. In Deep Learning in Cancer Diagnostics, 15–19. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-8937-7_3.
Głowala, Agnieszka. „Diagnoza dziecka w kontekście przekraczania progu szkolnego“. In Nauczyciel wczesnej edukacji. Oczekiwania społeczne i praktyka edukacyjna. Wydawnictwo Uniwersytetu Łódzkiego, 2011. http://dx.doi.org/10.18778/7525-559-1.09.
Voutharoja, Bhanu Prakash, Lei Wang und Luping Zhou. „Automatic Radiology Report Generation by Learning with Increasingly Hard Negatives“. In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230545.
„Maintenance modelling and optimisation Chemical process industry A hierarchical framework for the measurement of maintenance efficacy and efficiency using performance indicators“. In Safety and Reliability: Methodology and Applications, 1145–54. CRC Press, 2014. http://dx.doi.org/10.1201/b17399-159.
Konferenzberichte zum Thema "Optimisation efficace":
Varma, Nakul, Sujit Jadhav, Kumar Manish, Ravi Chandak, Avdesh Negi, Ajay Jha und Avinash Bohra. „Horizontal Sucker Rod Pumping Wells – Novel Unconventional Dyna Card Signatures Interpretation for Pump & Rod Run-life Optimisation“. In Asia Pacific Unconventional Resources Symposium. SPE, 2023. http://dx.doi.org/10.2118/217279-ms.
Manoj, M., R. G. Burela, D. Dzhurinskiy, A. Babu, A. Gupta und D. Harursampath. „Thermo-Mechanical Finite Element Analysis of the Laser Heat Treatment of WC-17Co Thermally Sprayed Coating“. In ITSC2022. DVS Media GmbH, 2022. http://dx.doi.org/10.31399/asm.cp.itsc2022p0928.
Kumar, Dilip, Sanjay Barad und T. N. Suresh. „Gas Turbine Blade Damper: A Design Optimization Study to Mitigate High Resonance Blade Vibration“. In ASME 2013 Gas Turbine India Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/gtindia2013-3748.
Dubey, Mayank. „Smart signals in heterogeneous traffic conditions“. In 55th ISOCARP World Planning Congress, Beyond Metropolis, Jakarta-Bogor, Indonesia. ISOCARP, 2019. http://dx.doi.org/10.47472/nsde5701.