Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Problème de placement d'UAV“
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 "Problème de placement d'UAV" 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 "Problème de placement d'UAV"
Bernier, Jean-Jacques. „Le passage du primaire au secondaire : un problème de placement“. Revue des sciences de l'éducation 5, Nr. 3 (09.10.2009): 433–39. http://dx.doi.org/10.7202/900121ar.
Der volle Inhalt der QuelleJoyal, Renée, und Carole Chatillon. „Le placement des enfants au Québec, des années 1930 à aujourd’hui. Une mesure trop souvent utilisée? Constatations et hypothèses“. Service social 45, Nr. 2 (12.04.2005): 31–50. http://dx.doi.org/10.7202/706725ar.
Der volle Inhalt der QuelleTraoré, Kadiatou, Joseph Traoré, A. Ouattara, Souleymane Papa Coulibaly, Pakuy Pierre Mounkoro, Aperou Eloi Dara, Mahamadou Diabaté et al. „Mali : Étude épidémioclinique des troubles psychiatriques chez les enfants du Centre d’Accueil et de Placement Familial CAPF « Pouponnière »“. Psy Cause N° 77, Nr. 2 (05.04.2018): 15–18. http://dx.doi.org/10.3917/psca.077.0017.
Der volle Inhalt der QuelleSuret, Jean-Marc. „Le financement des entreprises en démarrage et en croissance : le point de la situation“. L'Actualité économique 86, Nr. 3 (27.05.2011): 385–411. http://dx.doi.org/10.7202/1003528ar.
Der volle Inhalt der QuelleTremblay, Stéphane, Joël Tremblay und Marie Simard. „Gravité de la toxicomanie d’adolescents en traitement : liens avec l’auto-révélation de transitions familiales et de placements“. Drogues, santé et société 6, Nr. 2 (21.05.2008): 47–82. http://dx.doi.org/10.7202/018040ar.
Der volle Inhalt der QuelleHébert, Sophie T., und Nadine Lanctôt. „Les adolescentes placées en centre de réadaptation : regard sur l’instabilité à travers l’étude de leurs parcours de placements“. Revue de psychoéducation 45, Nr. 1 (17.03.2017): 63–85. http://dx.doi.org/10.7202/1039158ar.
Der volle Inhalt der QuelleYerochewski, Carole, und Diane Gagné. „Quand le droit conforte les stratégies syndicales reproduisant les arrangements institutionnels sources de discrimination systémique“. Articles 72, Nr. 3 (27.09.2017): 551–73. http://dx.doi.org/10.7202/1041097ar.
Der volle Inhalt der QuelleKareemi, Hashim, und Victoria Rose Myers. „Strategies for Improving the International Elective Process: SWOT Analysis of an Elective in Butare, Rwanda“. University of Ottawa Journal of Medicine 6, Nr. 2 (30.11.2016): 55–60. http://dx.doi.org/10.18192/uojm.v6i2.1813.
Der volle Inhalt der QuelleAfoukou Obossou, Achille Awadé, Rachidi Imorou Sidi, Raoul Sedjro Atade, Mahublo Vinadou Vodouhe, Roger Klikepezo, Amidou Salmane, Laure Kami Edwige Fado, Fanny Maryline Nouessèwa Hounkponou Ahouingnan und Kabibou Salifou. „Fréquence et Facteurs Associés au Paludisme chez les Femmes Enceintes dans les Maternités Périphériques Publiques de Parakou (Bénin) en 2018“. European Scientific Journal, ESJ 20, Nr. 3 (31.01.2024): 134. http://dx.doi.org/10.19044/esj.2024.v20n3p134.
Der volle Inhalt der QuelleHindriks, Jean. „Numéro 31 - juin 2005“. Regards économiques, 12.10.2018. http://dx.doi.org/10.14428/regardseco.v1i0.15963.
Der volle Inhalt der QuelleDissertationen zum Thema "Problème de placement d'UAV"
Ait, Saadi Amylia. „Coordination of scout drones (UAVs) in smart-city to serve autonomous vehicles“. Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG064.
Der volle Inhalt der QuelleThe subject of Unmanned Aerial Vehicles (UAVs) has become a promising study field in bothresearch and industry. Due to their autonomy and efficiency in flight, UAVs are considerablyused in various applications for different tasks. Actually, the autonomy of the UAVis a challenging issue that can impact both its performance and safety during the mission.During the flight, the autonomous UAVs are required to investigate the area and determineefficiently their trajectory by preserving their resources (energy related to both altitude andpath length) and satisfying some constraints (obstacles and axe rotations). This problem isdefined as the UAV path planning problem that requires efficient algorithms to be solved,often Artificial Intelligence algorithms. In this thesis, we present two novel approachesfor solving the UAV path planning problem. The first approach is an improved algorithmbased on African Vultures Optimization Algorithm (AVOA), called CCO-AVOA algorithms,which integrates the Chaotic map, Cauchy mutation, and Elite Opposition-based learningstrategies. These three strategies improve the performance of the original AVOA algorithmin terms of the diversity of solutions and the exploration/exploitation search balance. Asecond approach is a hybrid-based approach, called CAOSA, based on the hybridization ofChaotic Aquila Optimization with Simulated Annealing algorithms. The introduction of thechaotic map enhances the diversity of the Aquila Optimization (AO), while the SimulatedAnnealing (SA) algorithm is applied as a local search algorithm to improve the exploitationsearch of the traditional AO algorithm. Finally, the autonomy and efficiency of the UAVare tackled in another important application, which is the UAV placement problem. Theissue of the UAV placement relays on finding the optimal UAV placement that satisfies boththe network coverage and connectivity while considering the UAV's limitation from energyand load. In this context, we proposed an efficient hybrid called IMRFO-TS, based on thecombination of Improved Manta Ray Foraging Optimization, which integrates a tangentialcontrol strategy and Tabu Search algorithms
Gomez-Villouta, Giglia. „Méthodes heuristiques pour le problème de placement sur bande en deux dimensions“. Phd thesis, Université d'Angers, 2010. http://tel.archives-ouvertes.fr/tel-00575859.
Der volle Inhalt der QuelleGómez-Villouta, Giglia. „Méthodes heuristiques pour le problème de placement sur bande en deux dimensions“. Angers, 2010. http://www.theses.fr/2010ANGE0022.
Der volle Inhalt der QuellePacking problems are usually NP-hard, or NP-complete according to the objective. One has to locate a set of objects into one or more “container(s)”, with fix dimensions or of infinite height, while respecting constraints related to some characteristics (weight, quantity, rotation, stability, guillotine cuts. . . ). Themain interest of these problems are the numerous practical applications from various domains. The most effective solution strategies for these problems are usually approximate methods, local search in particular. In this thesis, we are interested in a particular two-dimensional packing problem (without rotation nor guillotine cuts) known as “strip packing” (SPP). The objective of this problem, after locating rectangular objects without overlap, is to minimize the height of the resulting packing. We developed two “meta-heuristic” approaches for the SPP, both including innovative components based on problem knowledge. The first one is a genetic algorithm with a new (highly “visual”) crossover and a hierarchical fitness function. The second one is a tabu search with “direct” representation (i. E. Not using the classical permutations) whose main characteristics are a consistent neighborhood, a “well-informed” diversification (based on the search history), and a fitness function able to evaluate possibly partial solutions. The two proposed approaches, assessed on a well-known and very difficult benchmark, show good performances compared with other strategies
Nguyen, Xuan-Nam. „Une approche « boite noire » pour résoudre le problème de placement des règles dans un réseau OpenFlow“. Thesis, Nice, 2016. http://www.theses.fr/2016NICE4012/document.
Der volle Inhalt der QuelleThe massive number of connected devices combined with an increasing traffic push network operators to their limit by limiting their profitability. To tackle this problem, Software-Defined Networking (SDN), which decouples network control logic from forwarding devices, has been proposed. An important part of the SDN concepts is implemented by the OpenFlow protocol that abstracts network communications as flows and processes them using a prioritized list of rules on the network forwarding elements. While the abstraction offered by OpenFlow allows to implement many applications, it raises the new problem of how to define the rules and where to place them in the network while respecting all requirements, which we refer as the OpenFlow Rules Placement Problem (ORPP). In this thesis, we focus on the ORPP and hide the complexity of network management by proposing a black box abstraction. First, we formalize that problem, classify and discuss existing solutions. We discover that most of the solutions enforce the routing policy when placing rules, which is not memory efficient in some cases. Second, by trading routing for better resource efficiency, we propose OFFICER and aOFFICER, two frameworks that select OpenFlow rules satisfying policies and network constraints, while minimizing overheads. The main idea of OFFICER an aOFFICER is to give high priority for large flows to be installed on efficient paths, and let other flows follow default paths. These proposals are evaluated and compared to existing solutions in realistic scenarios. Finally, we study a use case of the black box abstraction, in which we improve the performance of content delivery services in cellular networks
Bekrar, Abdelghani. „Résolution du problème de placement en deux dimensions : heuristiques, bornes inférieures et méthodes exactes“. Troyes, 2007. http://www.theses.fr/2007TROY0019.
Der volle Inhalt der QuelleIn this thesis we studied the two dimensional packing problem with guillotine cuts. For this problem we have proposed several methods to compute approximate solutions, lower bounds and exact solutions. We have developed two heuristics. The first one puts the items in levels and the second one puts the items in bottom-left positions without limitation to the levels. Both of the heuristics lead to guillotine configurations. We tested several methods to compute the lower bounds, namely : linear programming, the decomposition of the problem, the Lagrangian relaxation and the cutting plane method. To obtain exact solution, we have proposed three algorithms : the branch and bound method, the branch and price method and dichotomical search procedure. The performances of the proposed methods have been evaluated on instances of literature and other generated randomly
Saadi, Toufik. „Résolution séquentielles et parallèles des problèmes de découpe / placement“. Phd thesis, Université Panthéon-Sorbonne - Paris I, 2008. http://tel.archives-ouvertes.fr/tel-00354737.
Der volle Inhalt der QuelleBounsaythip, Catherine. „Algorithmes heuristiques et évolutionnistes : application à la résolution du problème de placement de formes irrégulières“. Lille 1, 1998. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/1998/50376-1998-241.pdf.
Der volle Inhalt der QuelleHamdi-Dhaoui, Khaoula. „Optimisation conjointe du transport et du placement avec des contraintes de sécurité“. Troyes, 2011. http://www.theses.fr/2011TROY0019.
Der volle Inhalt der QuelleIn this thesis, we present three extensions of classical combinatorial problems. The first problem is the Vehicle Routing Problem with conflicts which extends the well-known vehicle routing problem by adding incompatibility constraints between customers’ demands. The conflicting demands have to be therefore as-signed to different vehicles. The two-dimensional Bin Packing Problem is also generalized by introducing partial conflicts. A safe distance has to be kept between partially conflicting items assigned to the same bin. The third problem studied is an extension of the two Dimensional Loading Vehicle Routing Problem that considers partial conflicts. Two variants of this new problem are introduced: the first is mono-objective and the second one is bi-objective. In the bi-objective variant, the criterion of load balancing in terms of occupied area in the vehicle is considered in addition to total cost minimization of the routes. Several mathematical models have been pro-posed for these problems. Heuristic and Meta-heuristic methods have also been developed to solve them. A branch and cut algorithm has been used to obtain lower bounds for the vehicle routing problem with conflicts
Wu, Lei. „Contribution à la programmation linéaire en nombres entiers : problèmes de placement-chargement et knapsack“. Amiens, 2011. http://www.theses.fr/2011AMIE0112.
Der volle Inhalt der QuelleThis thesis deals with Integer Linear Programming (ILP) : an effective approach for modeling and solving combinatorial optimization problems. ILP is becoming more and more important for treating practical problems in recent research. Despite the fact that the problem has often a complex and highly combinatorial structure, ILP-based resolution methods may lose their effectiveness. The main goal of our framework is to reduce the completeness of ILP-based method by exploiting the problem's particular properties. In order to show how the ILP could contribute effectively to solving combinatorial optimization problems, we consider two NP-hard problems : 3D Single Bin-Size Bin Packing Problem and Multi-dimensional Multi-choice Multiple Knapsack Problem. The first problem comes from the industrial world, particularly in logistics processes where it is proposed to solve, for example, a problem of optimal allocation of boxes with a set of available containers (parcels, pallets, etc. ) in the process of a supply chain. The second problem can be encountered in real-world applications, such as service level agreement, model of allocation resources, or as a dynamic adaptation of system of resources for multimedia multi-sessions
Barrault, Mathieu. „Le placement cartographique des écritures : résolution d'un problème à forte combinatoire et présentant un grand nombre de contraintes variées“. Université de Marne-la-Vallée, 1998. http://www.theses.fr/1998MARN0031.
Der volle Inhalt der Quelle