Gotowa bibliografia na temat „Heuristiques de recherche locale”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Heuristiques de recherche locale”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Heuristiques de recherche locale"
de Galembert, Claire, i Mustapha Belbah. "Vertus heuristiques d'une recherche en tandem". Terrains & travaux 7, nr 2 (2004): 127. http://dx.doi.org/10.3917/tt.007.0127.
Pełny tekst źródłaMARCEL, Jean-François, i Véronique BEDIN. "Contribution à l’élaboration d’un dispositif d’évaluation de la Recherche-Intervention". Phronesis 7, nr 1 (27.03.2018): 79–91. http://dx.doi.org/10.7202/1044256ar.
Pełny tekst źródłaArnaud Liefooghe. "Excursion en optimisation multi-objectifs – heuristiques et paysages de recherche". Bulletin 1024, nr 23 (kwiecień 2024): 95–107. http://dx.doi.org/10.48556/sif.1024.23.95.
Pełny tekst źródłaBergadaà, Michelle, i Simon Nyeck. "Recherche en marketing: un état des controverses". Recherche et Applications en Marketing (French Edition) 7, nr 3 (wrzesień 1992): 23–44. http://dx.doi.org/10.1177/076737019200700302.
Pełny tekst źródłaMericskay, Boris, Matthieu Noucher i Stéphane Roche. "Usages des traces numériques en géographie : potentiels heuristiques et enjeux de recherche". L'Information géographique 82, nr 2 (2018): 39. http://dx.doi.org/10.3917/lig.822.0039.
Pełny tekst źródłaLegault, Marie-Josée. "Sciences humaines et sociales-sciences naturelles, une distinction inappropriée pour expliquer la propension à former des centres de recherche". Recherche 36, nr 3 (12.04.2005): 557–77. http://dx.doi.org/10.7202/056994ar.
Pełny tekst źródłaScherrer, Bruno, i Mathieu Geist. "Recherche locale de politique dans un espace convexe". Revue d'intelligence artificielle 29, nr 6 (28.12.2015): 685–704. http://dx.doi.org/10.3166/ria.29.685-704.
Pełny tekst źródłaSNINEH, My Hicham, i Hicham MESK. "Les théories fondatrices de la finance comportementale". International Journal of Financial Accountability, Economics, Management, and Auditing (IJFAEMA) 3, nr 5 (2.11.2021): 962–72. http://dx.doi.org/10.52502/ijfaema.v3i5.168.
Pełny tekst źródłaDelorme, Robert. "État et hétérogénéité : ERIC et le MPPE". Cahiers de recherche sociologique, nr 17 (19.04.2011): 153–83. http://dx.doi.org/10.7202/1002149ar.
Pełny tekst źródłaPauwels-Delassus, Véronique, i Marie-Hélène Fosse-Gûmez. "Les enjeux de l’abandon d’une marque locale". Décisions Marketing N° 67, nr 3 (1.08.2012): 11–22. http://dx.doi.org/10.3917/dm.067.0011.
Pełny tekst źródłaRozprawy doktorskie na temat "Heuristiques de recherche locale"
Danna, Emilie. "Intégration des techniques de recherche locale à la programmation linéaire en nombres entiers". Avignon, 2004. http://www.theses.fr/2004AVIG0132.
Pełny tekst źródłaWe present several algorithms for integrating local search technique into mixed integer programming (MIP). We first introduce a cooperation scheme between local search and branch-and-price that generalizes the concept of branch-and-cut heuristics to branch-and-price and we apply it successfully to the vehicle routing problem with time windows. We then present a new MIP heuristic that we call Relaxation Induced Neighborhood Search (RINS). This heuristic finds good integer solutions on models that previously were very difficult to solve. It is now implemented in ILOG CPLEX 9. RINS exploits the three fundamental concepts of local search (neighborhood, intensification, and diversification) and transposes them to mixed integer programming. This heuristic is generic : it can be applied to any MIP model, with no other input than the model itself. RINS allows us to formalize the notion of "hybrid in spirit'' algorithms. This development paradigm consists in using only one optimization technique and integrating into its framework concepts of other resolution techniques instead of having several software components cooperate. RINS performances and our analysis of difficulties encountered by existing hybrid algorithms suggest that this class of algorithms is promising. We finally concentrate on the job-shop scheduling problem with earliness and tardiness costs on which RINS is particularly effective. We propose several improvements and extensions of the disjunctive model for this problem and a heuristic (MCORE : big-M COefficient REduction) that could be generalized to other MIP models of similar structure. MCORE is also a "hybrid in spirit'' algorithm
Mynard, Laurent. "Exploration locale oscillante heuristiquement ordonnée". Paris 6, 1998. http://www.theses.fr/1998PA066255.
Pełny tekst źródłaGoëffon, Adrien. "Nouvelles heuristiques de voisinage et mémétiques pour le problème Maximum de Parcimonie". Phd thesis, Université d'Angers, 2006. http://tel.archives-ouvertes.fr/tel-00256670.
Pełny tekst źródłaDans cette thèse, nous nous intéressons en premier lieu à l'amélioration des techniques de résolution du problème MP basées sur un algorithme de descente. Après avoir montré de manière empirique les limites des voisinages existants, nous introduisons un voisinage progressif qui évolue au cours de la recherche afin de limiter l'évaluation de voisins infructueux lors d'une descente. L'algorithme obtenu est ensuite hybridé à un algorithme génétique utilisant un croisement d'arbres spécifique fondé sur les mesures de distance entre chaque couple d'espèces dans l'arbre. Cet algorithme mémétique exhibe des résultats très compétitifs, tant sur des jeux de test tirés de la littérature que sur des jeux générés aléatoirement.
Luong, Thé Van. "Métaheuristiques parallèles sur GPU". Thesis, Lille 1, 2011. http://www.theses.fr/2011LIL10058/document.
Pełny tekst źródłaReal-world optimization problems are often complex and NP-hard. Their modeling is continuously evolving in terms of constraints and objectives, and their resolution is CPU time-consuming. Although near-optimal algorithms such as metaheuristics (generic heuristics) make it possible to reduce the temporal complexity of their resolution, they fail to tackle large problems satisfactorily. Over the last decades, parallel computing has been revealed as an unavoidable way to deal with large problem instances of difficult optimization problems. The design and implementation of parallel metaheuristics are strongly influenced by the computing platform. Nowadays, GPU computing has recently been revealed effective to deal with time-intensive problems. This new emerging technology is believed to be extremely useful to speed up many complex algorithms. One of the major issues for metaheuristics is to rethink existing parallel models and programming paradigms to allow their deployment on GPU accelerators. Generally speaking, the major issues we have to deal with are: the distribution of data processing between CPU and GPU, the thread synchronization, the optimization of data transfer between the different memories, the memory capacity constraints, etc. The contribution of this thesis is to deal with such issues for the redesign of parallel models of metaheuristics to allow solving of large scale optimization problems on GPU architectures. Our objective is to rethink the existing parallel models and to enable their deployment on GPUs. Thereby, we propose in this document a new generic guideline for building efficient parallel metaheuristics on GPU. Our challenge is to come out with the GPU-based design of the whole hierarchy of parallel models.In this purpose, very efficient approaches are proposed for CPU-GPU data transfer optimization, thread control, mapping of solutions to GPU threadsor memory management. These approaches have been exhaustively experimented using five optimization problems and four GPU configurations. Compared to a CPU-based execution, experiments report up to 80-fold acceleration for large combinatorial problems and up to 2000-fold speed-up for a continuous problem. The different works related to this thesis have been accepted in a dozen of publications, including the IEEE Transactions on Computers journal
Kessaci, Marie-Éléonore. "Recherche locale et optimisation combinatoire : de l'analyse structurelle d'un problème à la conception d'algorithmes efficaces". Thesis, Lille 1, 2011. http://www.theses.fr/2011LIL10169/document.
Pełny tekst źródłaMany problems from combinatorial optimization are NP-hard, so that exact methods remain inefficient to solve them efficiently. However, metaheuristics are approximation methods known and used for their efficiency. But they often require a lot of parameters, which are very difficult to set in order to provide good performance. As a consequence, a challenging question is to perform such parameter tuning easier, or adaptive.The fitness landscape of given combinatorial optimization problem, based on a search space, a fitness function and a neighborhood relation, allow to characterize the problem structure and make the understanding of the dynamics of search approches possible.This thesis deals with fitness landscape analysis, together with the link with some neighborhood-based metaheuristic classes. We show the influence of the landscape structure on the dynamics of metaheuristics, for two challenging problems from the field of logistics. We analyze the landscape characteristics which help to design efficient local search metaheuristics and/or to set their parameters.Neutrality is one of the main structural characteristic of a landscape. Such landscapes have numerous plateaus, which often inhibits the progress of local search algorithms. After a deep analysis of these plateaus, we prove that this neutral structure cannot be ignored. Then, we use several information linked with neutrality, and particularly with blocking plateaus, in order to design a first local search approach, which appear to efficient and easy to implement. At last, in order to extend our work on the neutral structure, we chose to exploit the neutrality involved in the whole landscape. We propose a new local search algorithm, based on the ability of solutions of a plateau to produce improvement by means of a guiding strategy.The thesis ends with an experimental analysis of the two local search methods presented for neutral problems in order to exploit new characteristics, and then to strengthen the link between fitness landscape analysis and efficient algorithm design
Laroum, Sami. "Prédiction de la localisation des protéines membranaires : méthodes méta-heuristiques pour la détermination du potentiel d'insertion des acides aminés". Phd thesis, Université d'Angers, 2011. http://tel.archives-ouvertes.fr/tel-01064309.
Pełny tekst źródłaLaroum, Sami. "Prédiction de la localisation des protéines membranaires : méthodes méta-heuristiques pour la détermination du potentiel d'insertion des acides aminés". Phd thesis, Angers, 2011. https://theses.hal.science/tel-01064309.
Pełny tekst źródłaIn this work, we are interested in the localization of proteins transported towards the endoplasmic reticulum membrane, and more specifically to the recognition of transmembrane segments and signal peptides. By using the last knowledges acquired on the mechanisms of insertion of a segment in the membrane, we propose a discrimination method of these two types of sequences based on the potential of insertion of each amino acid in the membrane. This leads to search for each amino acid a curve giving its potential of insertion according to its place in a window corresponding to the thickness of the membrane. Our goal is to determine "in silico" a curve for each amino acid to obtain the best performances for our method of classification. The optimization, on data sets constructed from data banks of proteins, of the curves is a difficult problem that we address through the meta-heuristic methods. We first present a local search algorithm for learning a set of curves. Its assessment on the different data sets shows good classification results. However, we notice a difficulty in adjusting the curves of certain amino acids. The restriction of the search space with relevant information on amino acids and the introduction of multiple neighborhood allow us to improve the performances of our method and at the same time to stabilize the learnt curves. We also developed a genetic algorithm to explore in a more diversified way the space of search for this problem
Belaïdouni, Mériéma. "Métaheuristiques et paysages de recherche". Angers, 2001. http://www.theses.fr/2001ANGE0022.
Pełny tekst źródłaMetaheuristics are a class of methods which are able to provide solutions of good quality in a reasonnable amount of time for difficult combinatorial problems. There exist a large number of applications of these methods but only few studies concern their fondamental aspects. This thesis is devoted to study some fondamental issues of metaheuristics. Three tightly related axis are explored : 1)the study of problems properties and measures, 2)the study of dynamics of metaheuristics, 3)the establishment of the relations between measures of problems and dynamics of metaheuristics. To validate this approach we have apllied it to two NP-complete problems : MAX-CSP and SAT
Marmion, Marie-Eleonore. "Recherche locale et optimisation combinatoire : de l'analyse structurelle d'un problème à la conception d'algorithmes efficaces". Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2011. http://tel.archives-ouvertes.fr/tel-00682776.
Pełny tekst źródłaDupin, Nicolas. "Modélisation et résolution de grands problèmes stochastiques combinatoires : application à la gestion de production d'électricité". Thesis, Lille 1, 2015. http://www.theses.fr/2015LIL10107/document.
Pełny tekst źródłaMixed Integer Linear Programming (MILP) is a very popular and useful framework to model industrial optimization problems. This success is due to the facility to model complex optimization problems, the work can be focused on modeling, with a black box generic resolution to optimality with Branch&Bound (B&B) algorithm, or with a specialized decomposition algorithm. If MILP made lots of progresses on the last decades, it is often not sufficient to tackle real world size instances. In such cases, heuristic methods are commonly used to find good quality solutions, without any guarantee to reach the optimum and any proven bound to the optimum. Our work focus on two complex optimization problems from energy management. First application is a discretized daily Unit Commitment Problem of thermal units with specific dynamic constraints. Second application comes from the EURO/ROADEF 2010 challenge, scheduling problem of nuclear power plants' outages for maintenances and refueling. In both cases the methodology was first to model efficiently the considered problem with a MILP compact formulation, and analyze the frontal resolution's limits with B&B. Decomposition methods could also be investigated, before the exact methods are derived in a matheuristic, to be able to tackle real size instances. In particular, Variable Neighborhood Search (VNS) with MILP neighborhoods gave outstanding results on our problems. Our work allowed to estimate the impacts of usual and natural hypothesis. Furthermore, we derived dual bounds for these optimizations problems
Książki na temat "Heuristiques de recherche locale"
Doat, Mathieu. Recherche sur la notion de collectivité locale en droit administratif français. Paris: L.G.D.J., 2003.
Znajdź pełny tekst źródłaChanan, Gabriel. Sortir de l'ombre: L'action communautaire locale et la Communauté européenne : rapport final du projet de recherche Prise en charge des changements économiques et sociaux au niveau du quartier. Dublin: Fondation européenne pour l'amélioration des conditions de vie et de travail, 1992.
Znajdź pełny tekst źródłaDiamant, Peter. Réaction canadienne à l'enquête sur la gestion des affaires publiques urbaines: Groupe des affaires urbaines de l'OCDE : à l'intention de la Société canadienne d'hypothèques et de logement, Division de la recherche. Ottawa, Ont: Société canadienne d'hypothèque et de logement, Division de la recherche, 1997.
Znajdź pełny tekst źródłaResearching and writing history: A guide for local historians. Wyd. 3. Lancaster: Carnegie, 2009.
Znajdź pełny tekst źródłaThe Holy Grail: Imagination and belief. London ; New York, N.Y: Allen Lane, 2004.
Znajdź pełny tekst źródłaThe Holy Grail: Imagination and belief. Cambridge, MA: Harvard University Press, 2004.
Znajdź pełny tekst źródłaLord, Evelyn. Investigating the twentieth century: Sources for the local historian. Stroud: Tempus, 1999.
Znajdź pełny tekst źródłaLoomis, Roger Sherman. The Grail: From Celtic myth to Christian symbol. Princeton, N.J: Princeton University Press, 1991.
Znajdź pełny tekst źródłaJacques, Fialaire, i Montalivet Pierre de, red. Coopération locale et territoires: Actes du colloque organisé par l'Institut de recherche sur les entreprises et les administrations (IREA), le 15 mars 2007 à la Faculté de droit, des sciences économiques et de gestion de l'Université de Bretagne-sud (Vannes). Paris: Litec, 2008.
Znajdź pełny tekst źródłaMarceau, Anne. La démocratie locale à la recherche d'un nouveau souffle. Editions L'Harmattan, 2013.
Znajdź pełny tekst źródłaCzęści książek na temat "Heuristiques de recherche locale"
Díaz, Cristina. "Prévention de la dengue à l’échelle locale à La Havane". W La Recherche Écosanté en pratique, 183–92. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4614-5281-2_15.
Pełny tekst źródłaTunon de Lara, C., M. Debled, M. Fournier, G. Macgrogan i A. L. Cazeau. "Faisabilité de la recherche du ganglion sentinelle en cas de rechute locale". W Acquis et limites en sénologie / Assets and limits in breast diseases, 473–74. Paris: Springer Paris, 2013. http://dx.doi.org/10.1007/978-2-8178-0396-8_107.
Pełny tekst źródła"4: La contribution de documents diplomatiques à l’historiographie bénédictine locale au Xe siècle". W Atelier de recherche sur les textes médiévaux, 247–52. Turnhout: Brepols Publishers, 2014. http://dx.doi.org/10.1484/m.artem-eb.4.00186.
Pełny tekst źródła"7: La contribution de documents diplomatiques à l’historiographie bénédictine locale au XIIe siècle". W Atelier de recherche sur les textes médiévaux, 341–45. Turnhout: Brepols Publishers, 2014. http://dx.doi.org/10.1484/m.artem-eb.4.00189.
Pełny tekst źródłaFaure, Alain, i Pierre Muller. "Cycle, réseaux, récits : questions de recherche sur l’action publique locale-globale". W Production et circulation des normes pour l’action territoriale, 31–39. Presses universitaires de la Méditerranée, 2016. http://dx.doi.org/10.4000/books.pulm.3301.
Pełny tekst źródłaSIMONFFY, Zsuzsa. "Pour aborder l’étude de l’articulation entre prévisible et imprévisible en matière de sens". W Le prévisible et l’imprévisible, 213–24. Editions des archives contemporaines, 2023. http://dx.doi.org/10.17184/eac.7081.
Pełny tekst źródła"Traçabilité et médiation linguistique dans le transfert des techniques culturales". W Linguistique pour le Développement, 205–24. Editions des archives contemporaines, 2022. http://dx.doi.org/10.17184/eac.5241.
Pełny tekst źródłaJullia, Patricia, i Frédéric Marty. "Un si grand soleil, une série très « Sud de France » ?" W Marque et Territoire : Dispositifs, stratégies et enjeux, 189–210. Éditions de l'Université de Lorraine, 2023. http://dx.doi.org/10.62688/edul/b9782384510122/c03c.
Pełny tekst źródłaÉveno, Emmanuel. "Recherche sur les relations entre villes et tic : nouveaux services urbains, démocratie locale, citoyenneté". W Quatre ans de recherche urbaine 2001-2004. Volume I, 441–44. Presses universitaires François-Rabelais, 2006. http://dx.doi.org/10.4000/books.pufr.1233.
Pełny tekst źródłaHollard, Guillaume. "Le renouveau de la démocratie locale : de participation en représentation. Des Comités aux Conseils de quartier, entre pratiques clientélaires et politiques de proximité". W Quatre ans de recherche urbaine 2001-2004. Volume I, 285–90. Presses universitaires François-Rabelais, 2006. http://dx.doi.org/10.4000/books.pufr.1177.
Pełny tekst źródłaStreszczenia konferencji na temat "Heuristiques de recherche locale"
Rolbert, Monique. "Des heuristiques pour la recherche du theme d'un discours et de l'antecedent d'un pronom". W the 13th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1990. http://dx.doi.org/10.3115/992507.992510.
Pełny tekst źródłaCHEVALLIER, Marius. "La recherche locale au service de la transition socio-écologique : une analyse à partir de travaux en sciences sociales". W Les journées de l'interdisciplinarité 2022. Limoges: Université de Limoges, 2022. http://dx.doi.org/10.25965/lji.646.
Pełny tekst źródłaRaporty organizacyjne na temat "Heuristiques de recherche locale"
Latané, Annah, Jean-Michel Voisard i Alice Olive Brower. Les réseaux de producteurs du Sénégal font face à la COVID-19. RTI Press, wrzesień 2021. http://dx.doi.org/10.3768/rtipress.2021.rr.0045.2106.fr.
Pełny tekst źródłaRousseau, Henri-Paul. Gutenberg, L’université et le défi numérique. CIRANO, grudzień 2022. http://dx.doi.org/10.54932/wodt6646.
Pełny tekst źródłaRecensement des Priorités de Recherche sur L’extrémisme Violent en Afrique du Nord et au Sahel 2018. RESOLVE Network, styczeń 2021. http://dx.doi.org/10.37805/rp2021.2.lcb.
Pełny tekst źródła