Дисертації з теми "Résolution créative de problème"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Résolution créative de problème".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Pilon, Catherine. "Modélisation des stratégies cognitives de résolution de problèmes mises en oeuvre en contexte créatif publicitaire." Mémoire, Université de Sherbrooke, 2012. http://hdl.handle.net/11143/5723.
Mercier, Chloé. "Modéliser les processus cognitifs dans une tâche de résolution créative de problème : des approches symboliques à neuro-symboliques en sciences computationnelles de l'éducation." Electronic Thesis or Diss., Bordeaux, 2024. http://www.theses.fr/2024BORD0065.
Integrating transversal skills such as creativity, problem solving and computational thinking, into the primary and secondary curricula is a key challenge in today’s educational field. We postulate that teaching and assessing transversal competencies could benefit from a better understanding of the learners’ behaviors in specific activities that require these competencies. To this end, computational learning science is an emerging field that requires the close collaboration of computational neuroscience and educational sciences to enable the assessment of learning processes. We focus on a creative problem-solving task in which the subject is engaged into building a “vehicle” by combining modular robotic cubes. As part of an exploratory research action, we propose several approaches based on symbolic to neuro-symbolic formalisms, in order to specify such a task and model the behavior and underlying cognitive processes of a subject engaged in this task. Despite being at a very preliminary stage, such a formalization seems promising to better understand complex mechanisms involved in creative problem solving at several levels: (i) the specification of the problem and the observables of interest to collect during the task; (ii) the cognitive representation of the problem space, depending on prior knowledge and affordance discovery, allowing to generate creative solution trajectories; (iii) an implementation of reasoning mechanisms within a neuronal substrate
Bélanger, Jean-Philippe. "L'imagination créative pour interpréter des productions d'élèves en mathématiques de la fin du primaire et du début du secondaire en résolution de problèmes." Thesis, Université Laval, 2014. http://www.theses.ulaval.ca/2014/30585/30585.pdf.
Gravelle, Diane. "Effet d'un programme de formation en approche créative à la résolution de problèmes (CPS) sur les aptitudes créatives de l'infirmière et sur leur utilisation lors de l'application de son processus d'intervention." Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7675.
Langevin, Paul. "Potentiel créatif, comportements de découverte et originalité du produit chez le photographe amateur : II. La résolution du problème photographique." Thèse, Université du Québec à Trois-Rivières, 1998. http://depot-e.uqtr.ca/4789/1/000642318.pdf.
Goria, Stéphane. "L'Expression du problème dans la Recherche d'Informations: Application à un contexte d'Intermédiation Territoriale." Phd thesis, Université Nancy II, 2006. http://tel.archives-ouvertes.fr/tel-00011918.
Nelson, Julien. "Contribution à l'analyse prospective des usages dans les projets d'innovation." Phd thesis, Paris, ENSAM, 2011. http://pastel.archives-ouvertes.fr/pastel-00620406.
Fouks, Jean-Denis. "La résolution du problème de satisfiabilité." Mulhouse, 1991. http://www.theses.fr/1991MULH0175.
Labbé, Julie. "Résolution itérative du problème tridimensionnel de Stokes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ57870.pdf.
Ben, Mohamed Ahmed Mohamed Abdellahi. "Résolution approchée du problème de bin-packing." Le Havre, 2009. http://www.theses.fr/2009LEHA0031.
Abramé, André. "Max-résolution et apprentissage pour la résolution du problème de satisfiabilité maximum." Thesis, Aix-Marseille, 2015. http://www.theses.fr/2015AIXM4330/document.
This PhD thesis is about solving the Maximum Satisfiability (Max-SAT) problem. We study the mechanisms related to the detection and transformations of the inconsistent subsets by the max-resolution rule. In the context of the branch and bound (BnB) algorithms, we present several contributions related to the lower bound computation. They range from the study of the unit propagation scheme used to detect inconsistent subsets to the extension of the learning criteria and to the evaluation of the impact of the max-resolution transformations on the BnB solvers efficiency. Thanks to our contributions, we have implemented a new solver which is competitive with the state of art ones. We give insights allowing a better understanding of the behavior of BnB solvers as well as theoretical elements which contribute to explain the efficiency of these solvers and their limits. It opens new development perspectives on the learning mechanisms used by BnB solvers which may lead to a better consideration of the instances structural properties. We also present an example of integration of the max-resolution inference rule in a local search algorithm
Derrien, Vincent. "Heuristiques pour la résolution du problème d'alignement multiple." Phd thesis, Université d'Angers, 2008. http://tel.archives-ouvertes.fr/tel-00352784.
Le premier algorithme, Plasma utilise une méthode de descente, dont chaque itération consiste à réaliser des insertions de colonnes de brèches dans deux alignements multiples à aligner. Le second algorithme, Plasma II , est basé sur le principe de la programmation dynamique. Nous généralisons ici l'algorithme utilisé pour l'alignement de deux séquences, et étendons le cadre de la programmation dynamique `a l'alignement de deux alignements multiples. Cet algorithme ainsi que plusieurs variantes sont intensivement évalués sur les jeux d'essais de Balibase, montrant des résultats encourageants, voire compétitifs, par rapport à certains algorithmes de référence comme Clustal W, tant sur la qualité de l'alignement que sur le temps de calcul.
Fresnel, Christophe. "Résolution numérique d'un problème d'interdiffusion intervenant en métallurgie." Bordeaux 1, 1987. http://www.theses.fr/1987BOR10537.
Ezzroura, Elhassan. "Sur la résolution numérique du problème de Stefan." Besançon, 1988. http://www.theses.fr/1988BESA2020.
Vallade, Vincent. "Contributions à la résolution parallèle du problème SAT." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS260.
This thesis presents multiple and orthogonal contributions to the improvement of the parallel resolution of the Boolean satisfiability problem (or SAT problem). An instance of the SAT problem is a propositional formula of a particular form (the conjunctive normal form is the most common) representing, in general, the variables and constraints of a real-world problem, such as multi-constraint planning, hardware and software verification or cryptography. Solving the SAT problem involves determining whether there is an assignment of variables that satisfies the formula. An algorithm capable of providing an answer to this problem is called a SAT solver. A simplified view of a SAT solver is an algorithm that will traverse the set of possible combinations of values for each variable until it finds a combination that makes the formula true (the formula is SAT). If the solver has gone through all the possible combinations without finding a solution, the formula is UNSAT. Obviously, this algorithm has an exponential complexity, indeed the SAT problem is the first problem to have been determined NP-complete. Many algorithms and heuristics have been developed to accelerate the solving capacity of this problem, mainly in a sequential context. The ubiquity of multi-core machines has encouraged considerable efforts in the parallel resolution of the SAT problem. This thesis is a continuation of these efforts. The contributions made by this thesis focus on the quality of information sharing between the different workers of a parallel SAT solver. A first contribution presents an efficient method to implement an asynchronous algorithm for reducing the size of the shared information. A second contribution combines the information extracted from the particular structure of the propositional formula with the information extracted dynamically during the resolution of the problem by the solver in order to create a filter that maximizes the quality of the shared information. Finally, a last contribution deals with the integration of a component allowing to determine in a probabilistic way the truth value of the variables allowing to make a formula satisfiable. The call of this component during the solving process allows to guide the solver more quickly towards a solution (if a solution exists)
Billon, Chritine-Olga. "Résoudre un problème sous contraintes externes contradictoires." Aix-Marseille 1, 1997. http://www.theses.fr/1997AIX10099.
Kagabo, Issa. "Contributions à la résolution du problème de transport continu." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0014/NQ39754.pdf.
Nogry, Sandra. "Faciliter l'apprentissage à partir d'exemples en situation de résolution de problèmes : Application au projet AMBRE." Lyon 2, 2005. http://theses.univ-lyon2.fr/documents/lyon2/2005/nogry_s.
Analysing worked out examples and solving new problems by analogy can enable contextual and abstract knowledge to be acquired. However, this knowledge acquisition is not always automatic. How can we facilitate knowledge acquisition within the context of learning from examples? We propose that one way to facilitate learning consists in encouraging or facilitating the implementation of knowledge generalisation processes. To verify this hypothesis, we conducted five experiments and we showed that some presentation formats for instructional material, for instance reducing the salience of important features, play a positive role on the implementation of learning processes and facilitate the acquisition abstract knowledge. In parallel, we applied some theoretical and some empirical studies about learning from examples in order to design intelligent tutoring systems (ITS) in the framework of the AMBRE project. These ITS present to the learners worked out examples and then, guide them in their problem solving through five stages inspired by the case-based-reasoning cycle. In this project, we specified the processes that we wished to see implemented in the ITS and we made various recommendations intended to facilitate the implementation of these processes. Then, we participated to the design of AMBRE-add, an ITS for arithmetical word problems solving. Finally, we evaluated its utilisability, its utility and we analysed the usage of the system. This study lead us to considering how to apply theoretical and empirical studies from cognitive psychology to the design of ITS. And to express considerations about the methods to use in order to evaluate ITS
Defoin, Platel Michael. "Homologie en Programmation GénétiqueApplication à la résolution d'un problème inverse." Phd thesis, Université de Nice Sophia-Antipolis, 2004. http://tel.archives-ouvertes.fr/tel-00131993.
La Programmation Génétique (PG) est un AE qui permet la recherche automatique de programmes et qui manipule des représentations complexes : arbres (PGA) ou listes de longueur variables (PGL).
Les variations aléatoires permettant de créer de nouveaux programmes peuvent être des modifications locales (mutations) ou des recombinaisons de programmes (croisements).
L'opérateur de croisement recombine aléatoirement des sous-parties de programmes sans tenir compte du contexte : c'est une opération «brutale» qui est une des causes supposées de la croissance incontrôlée de la taille des programmes.
Inspirés par la recombinaison homologue de l'ADN, nous définissons, le Croisement par Maximum d'Homologie (CMH) pour la PGL.
A partir d'une mesure de similarité entre les expressions à recombiner, le CMH favorise les échanges qui respectent les structures communes préexistantes.
La capacité du CMH à effectuer une recherche moins brutale et à permettre un contrôle précis de la taille des programmes est mise en évidence sur des problèmes classiques de PG comme l'approximation de fonctions par régression symbolique.
En partant des différents résultats obtenus, nous appliquons notre méthode à la résolution d'un problème réel : l'inversion des composantes atmosphériques. De plus, nous montrons comment, à coût constant, il est possible de rechercher des combinaisons de modèles inverses dont les performances sont supérieures aux modèles standards.
Cherfi, Nawal. "Méthodes de résolution hybrides pour les problème de type knapsack." Phd thesis, Université Panthéon-Sorbonne - Paris I, 2008. http://tel.archives-ouvertes.fr/tel-00401980.
Mazet, Laurent. "Construction de surfaces minimales par résolution du problème de Dirichlet." Phd thesis, Université Paul Sabatier - Toulouse III, 2004. http://tel.archives-ouvertes.fr/tel-00007780.
Bouzaiene, Afef. "Etude et résolution d'un problème bi-critère d'ordonnancement par lots." Paris 9, 2011. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=2011PA090065.
We consider the two-machine flowshop serial-batching scheduling problem where the machines have a limited capacity. The processing time of a batch is equal to the sum of total processing time of the jobs contained in it, and the completion time of a job in a batch is defined as the completion time of the batch containing it. Two criteria to be minimized are considered here. The first criterion is the makespan. The second criterion is the number of batches. This criterion reflects a situation where processing of any batch induces a fixed cost, which leads to a total cost proportional to the number of batches. We show that we can restrict our search to efficient schedules having consistent batches. We study the complexity of the problem in a particular case and propose in the general case a linear programming formulation and a polynomial dynamic programming algorithm that can be used for a fixed job sequence. In case of unit sized jobs, we develop two polynomial-time approximation algorithms with a guaranteed performance and also provide exact polynomial-time algorithms and a dominance relation for some particular cases. Finally, we lead an experimental study to compare linear program and dynamic program results
Housroum, Haiyan. "Une approche génétique pour la résolution du problème VRPTW dynamique." Artois, 2005. http://www.theses.fr/2005ARTO0203.
These last years the systems of transport used for the collecting and the distribution of goods or services were the subject of many studies in the scientific community. Nowadays, the majority of the systems of transport must be able to deal with strict temporal constraints. Indeed, the customers or partners of a company require these constraints for the quality of service to be guaranteed. Moreover, the environment in which a company must operate is very often instable and thus its reactivity is also a significant asset. This results in defining models of piloting of the systems of transport known as dynamic in which part of the data of the problem depends on the time. Our work concerns the basic Vehicle Routing Problem VRP. This problem consists of a number of distributed customers, each requiring a specified weight of goods to be delivered. Vehicles dispatched from a single depot must deliver the goods required, then return to the depot. Each vehicle can carry a limited weight and only one vehicle is allowed to visit each customer. The problem is to find a set of delivery routes satisfying these requirements and giving minimal total cost. In practice, this is often taken to be equivalent to minimise the total distance travelled, or to minimise the number of vehicles used and then minimising total distance for this number of vehicles. The work presented in this thesis deals more precisely with the resolution of the Dynamic Vehicle Routing Problem with Time Windows DVRPTW and some of its extensions. The objective of this work was double. Firstly, it was a question of proving that the evolutionary algorithms can be used within a dynamic framework. In addition, it had to be checked that the performances, of this type of approach, were comparable with those of the best techniques up to now. To achieve these goals, we used the technique of the Genetic Algorithms (GA) to define a planner driven by the events. This planner aims to dynamically optimize the problem after each significant event (“arrival of a new request” and “end of service at a customer”) occurring throughout the day of service. The genetic algorithm is based on chromosomes of variable size in time, making it possible to take into account the arrival of new customers during the effective execution of the routes by vehicles. The effectiveness of the GA approaches raises the difficult question of the tuning of certain of parameters such as crossover or mutation rates. We used a tuning “a priori” of these parameters by using the technique of the experimental designs. The last point of this thesis relates to a software platform developed in JAVA to evaluate our approach and to compare the results with those obtained by other approaches
Guo, Long. "Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle." Thesis, Artois, 2013. http://www.theses.fr/2013ARTO0408/document.
In this thesis, we deal with the sequential and parallel resolution of the problem SAT. Despite of its complexity, the resolution of SAT problem is an excellent and competitive approach for solving thecombinatorial problems such as the formal verification of hardware and software, the cryptography, theplanning and the bioinfomatics. Several contribution are made in this thesis. The first contribution aims to find the compromise of diversification and intensification in the solver of type portfolio. In our second contribution, we propose to dynamically adjust the configuration of a core in a portfolio parallel sat solver when it is determined that another core performs similar work. In the third contribution, we improve the strategy of reduction of the base of learnt clauses, we construct a portfolio strategy of reduction in parallel solver. Finally, we present a new approach named "Virtual Control" which is to distribute the additional constraints to each core in a parallel solver and verify their consistency during search
Lonlac, Konlac Jerry Garvin. "Contributions à la résolution du problème de la Satisfiabilité Propositionnelle." Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0404/document.
In this thesis, we focus on propositional satisfiability problem (SAT). This fundamental problem in complexity theory is now used in many application domains such as planning, bioinformatic, hardware and software verification. Despite enormous progress observed in recent years in practical SAT solving, there is still a strong demand of efficient algorithms that can help to solve hard problems. Our contributions fit in this context. We focus on improving two of the key components of SAT solvers: clause learning and variable ordering heuristics. First, we propose a resolution method that allows to exploit hidden Boolean functions generally introduced during the encoding phase CNF to reduce the size of clauses learned during the search. Then, we propose an resolution approach based on the intensification principle that circumscribe the variables on which the solver should branch in priority at each restart. This principle allows the solver to direct the search to the most constrained sub-formula and takes advantage of the previous search to avoid exploring the same part of the search space several times. In a third contribution, we propose a new clause learning scheme that allows to derive a particular Bi-Asserting clauses and we show that their exploitation significantly improves the performance of the state-of-the art CDCL SAT solvers. Finally, we were interested to the main learned clauses database reduction strategies used in the literature. Indeed, starting from two simple strategies : random and size-bounded reduction strategies, and motivated by the results obtained from these strategies, we proposed several new effective ones that combine maintaing short clauses (of size bounded by k), while deleting randomly clauses of size greater than k. Several other efficient variants are proposed. These new strategies allow us to identify the most important learned clauses for the search process
Paris, Nicolas. "Intégration de techniques CSP pour la résolution du problème WCSP." Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0405/document.
This thesis is in the context of constraint programming (CP). Specifically, we are interested in the Weighted Constraint Satisfaction Problem (WCSP). Many approaches have been proposed to handle this optimization problem. The most effective methods use sophisticated soft local consistencies such as, for example, full directional arc consistency FDAC∗, existential directional arc consistency EDAC∗, etc. Established by equivalence preserving transformations (cost transfer operations), the use of these consistencies generally allows both to accelerate the resolution by reducing the search space through the elimination of values and to compute lower bounds useful in practice. However, these methods reach theirlimits when the arity of constraints increases significantly. The techniques of the Constraint Satisfaction Problem framework (CSP) having proved efficienty, we believe that the integration of CSP techniques can be very useful for solving WCSP instances. In this thesis, we first propose a filtering algorithm to enforce a soft version of generalized arc consistency (GAC∗) on soft table constraints of large arity. This approach combines the techniques of simple tabular reduction (STR), from the CSP framework, with the techniques of cost transfer. Our approach, proved polynomial, efficiently calculates for each value the minimum cost of the explicit and implicit tuples from soft table constraints. The minimum costs are thenused to transfer costs to establish GAC∗. In a second step, we propose an alternative approach to the usual techniques to solve WCSP. The principle is to solve a WCSP instance by solving a sequence of classical CSP instances obtained from this WCSP instance. From a CSP instance containing all the constraints hardened to the maximum from the WCSP instance, the next CSP instances correspond to a progressive relaxation of constraints defined by extraction of minimal unsatisfiable cores (MUC) from unsatisfiable networks of the sequence. Our experimental results show that our first approach is competitive with the state-of-the-art, whereas the second one represents an alternative approach to the usual methods to solve WCSP instances
Godard, Hadrien. "Résolution exacte du problème de l'optimisation des flux de puissance." Thesis, Paris, CNAM, 2019. http://www.theses.fr/2019CNAM1258/document.
Alternative Current Optimal Power Flow (ACOPF) is naturally formulated as a non-convex problem. In that context, solving (ACOPF) to global optimality remains a challenge when classic convex relaxations are not exact. We use semidefinite programming to build a quadratic convex relaxation of (ACOPF). We show that this quadratic convex relaxation has the same optimal value as the classical semidefinite relaxation of (ACOPF) which is known to be tight. In that context, we build a spatial branch-and-bound algorithm to solve (ACOPF) to global optimality that is based on a quadratic convex programming bound
Godard, Hadrien. "Résolution exacte du problème de l'optimisation des flux de puissance." Electronic Thesis or Diss., Paris, CNAM, 2019. http://www.theses.fr/2019CNAM1258.
Alternative Current Optimal Power Flow (ACOPF) is naturally formulated as a non-convex problem. In that context, solving (ACOPF) to global optimality remains a challenge when classic convex relaxations are not exact. We use semidefinite programming to build a quadratic convex relaxation of (ACOPF). We show that this quadratic convex relaxation has the same optimal value as the classical semidefinite relaxation of (ACOPF) which is known to be tight. In that context, we build a spatial branch-and-bound algorithm to solve (ACOPF) to global optimality that is based on a quadratic convex programming bound
Rubio, Agüero Jesús Ramón. "Formation a la resolution de problemes de mathematiques dans le deug scientifique." Paris 11, 1995. http://www.theses.fr/1995LYO20048.
This thesis presents the results of a research on the teaching of methods as an aid to the students in the resolution of mathematical problems in scientific deug (first two years of university studies in natural sciences). On the basis of these results i make some propositions to ameliorate the problem solving capacity of the students in this level, notably in the field of probabilities. I present the results of some essays of this method, which appear to be encouraging besides, this research suggests a first classification of the difficulties that this type of teaching meets ; they may be grouped in four types : a) ignorance of the students about the formalisms which are necessary in posing and solving mathematical problems ; b) bad habits created by previous non adecuate teaching ; c) inefficient interelationship between teachers and students (bad communication, loosely defined pedagogical contract, etc. ) ; d) teaching non adapted to the cognitive situation of the students (bad corrdination of the different levels of studies)
Zanga, Aldo. "L'apprentissage implicite en résolution de problèmes." Paris 8, 1998. http://www.theses.fr/1998PA081441.
This work is located at the crosspoint of two problematics: rule inducing and problem solving. Implicit learning has been widely studied in rule inducing, but never really in problem solving. Solving a problem, is to start from an initial state for reaching a final state through a space search. In many problems, this process involves rule inducing. We assume that reaching the goal requires a planification of moves that obscures the rule inducing mecanism. For studying this two process, we adopted the chinese ring puzzle (pac) which contains an initial and a final states, a space search and rules governing the moves. In the two first experiments, we have insured on the possibility of rule inducing and their verbalization (experiment 1), on understanding and use of that rule (experiment 2) for both adults and children. The third experiment demonstrates that adults, when planification is not required, performed better the task when they see how to reach the goal, than when they don't perceive it. On the other hand, whenever the planification of moves is required, the knowledge of the goal obscures rule inducing (experiment 4) because it is necessary to define other subgoals for reaching the main one. We demonstrate that learning and verbalization are dissociated; indeed we discovered a great difference between performance and related verbalizations (experiment 5). Finally, last experiment demonstrates that when the task is semantically perceived through the links that bind objets; the more the problem involves semantic links, the easyer are problem solving and related verbalizations
Graf, Kathrin. "La médiation : une approche constructive à la hauteur des conflits de notre temps : un pont possible entre la justice et la paix dans un monde pluraliste." Thesis, Paris 2, 2017. http://www.theses.fr/2017PA020052/document.
This work aims to provide a multidisciplinary approach - historical, socio-political, economic, and psychological - to understand the general interest of constructive conflict management, and in particular the opportunities related to the method of mediation. The thesis reflects the path taken - from deconstruction to reconstruction of the subject - beginning with a theoretical analysis (origins, specificities, differences with other methods, values and principles) and considering the individual and collective phenomena inherent to each conflict and its management (levels of conflict, management dimensions, individual psychological foundations, opportunities of integrative bargaining, but also the limits and risks associated with the method of mediation). The present work also takes into account the personal evolution of the researcher, her practice as a mediator, exchanges with other professionals on this behalf and her personal findings of feasibility (practical advice, logistical organization, concrete tools for the various phases, and the restitution of the key steps of a practical case). Key words : active listening, alternative dispute resolution, arbitrary, communication facilitation, conciliation, confidentiality, consensus, constructive and effective conflict management, creative problem-solving, decision science, dialogue, empathy training, empowerment, Harvard negotiation model, impartiality, integrative bargaining, looping, mediative solutions, moderation, negotiation, “pareto optimal” solutions, peacemaking, process management, reconciliation, reframing, settlements, supervision, therapy, understanding, zone of possible agreements
Defoin, Platel Michaël. "Homologie en programmation génétique : application à la résolution d'un problème inverse." Nice, 2004. http://www.theses.fr/2004NICE4109.
Les Algorithmes Évolutionnaires (AE) sont des méthodes de recherche par itération de sélections et de variations aléatoires sur une population de solutions potentielles. La Programmation Génétique (PG) est un AE qui permet la recherche automatique de programmes et qui manipule des représentations complexes : arbres (PGA) ou listes de longueur variables (PGL). Les variations aléatoires permettant de créer de nouveaux programmes peuvent être des modifications locales (mutations) ou des recombinaisons de programmes (croisements). L'opérateur de croisement recombine aléatoirement des sous-parties de programmes sans tenir compte du contexte : c'est une opération «brutale» qui est une des causes supposées de la croissance incontrôlée de la taille des programmes. Inspirés par la recombinaison homologue de l'ADN, nous définissons, le Croisement par Maximum d'Homologie (CMH) pour la PGL. A partir d'une mesure de similarité entre les expressions à recombiner, le CMH favorise les échanges qui respectent les structures communes préexistantes. La capacité du CMH à effectuer une recherche moins brutale et à permettre un contrôle précis de la taille des programmes est mise en évidence sur des problèmes classiques de PG comme l'approximation de fonctions par régression symbolique. En partant des différents résultats obtenus, nous appliquons notre méthode à la résolution d'un problème réel : l'inversion des composantes atmosphériques. Nous montrons comment, à coût constant, il est possible de rechercher des combinaisons de modèles inverses dont les performances sont supérieures aux modèles standards
Ahssaini, Ali. "Résolution numérique d'un problème inverse 2-D de convection naturelle stationnaire." Nantes, 2005. http://www.theses.fr/2005NANT2091.
This study deals with a stationary natural convection inverse problem. The problem is formulated in the case of a square differentially heated cavity, it aims at identifying the heat flux density on a face of the cavity knowing the boundary conditions on the three others faces. The temperature is imposed on the other vertical face and the two others faces are adiabatic. Additional information is then necessary to the resolution of the problem, we examine the cases where the temperature is known on one or the other of the horizontal faces of the cavity. The problem is stated as the optimisation of a least squares functional , the solution is then characterized by the optimality condition. The method of the conjugate gradient is developed to solve this type of problem numerically. The implementation of the algorithm is based on the exact calculation of the gradient of the functional. One shows how the standard Lagrangian approach makes it possible to arrive to this result by introducing a system of equations known as adjoint equations, to the Navier-Stokes equations which model the direct problem. Several numerical results are presented to illustrate the questions of sensitivity of measurements at the unknown heat flux to estimate, as well as the influence of the location of the sensors and that of the initialization of the algorithm
Begoin-Augereau, Sandra. "Effets des labels verbaux dans une résolution de problème : approche énonciative." Poitiers, 2003. http://www.theses.fr/2003POIT5001.
Souid, Mahdi. "Résolution approchée d'un problème de tournées de véhicule avec contraintes d'accessibilité." Valenciennes, 2003. http://www.theses.fr/2003VALE0041.
In a competitive context, enterprises must improve the efficiency of their logistical chains, in order to optimize the factors cost and time of service. A fundamental element of all logistical system is the management and the scheduling of distribution networks. Our survey consists in treating a problem of location and routing called Vehicle Routing Problem with Accessibility constraint (VRPA). The problematic consists in supplying, at least cost, a set of customers with a road-train composed of a truck and a trailer, while taking account the accessibility constraint. We proposed two models for the VRPA and developed three heuristics for resolution of the PTVA. First, we implement methods that can be considered as two phases methods. The first phase consists in solving a location problem and the second phase to solve routing problems. Then, we present methods of resolution of the PTVA based on variable neighbourhood search method. Finally, we present three tabu search methods for the resolution of the PTVA
Sushchenko, Anton. "Résolution numérique d'un problème tridimensionnel en présence d'imperfection de petit volume." Cergy-Pontoise, 2010. http://biblioweb.u-cergy.fr/theses/2010CERG0455.pdf.
The objective of this thesis is to build a stable and robust method and its numerical algorithm to detect small volume inclusions distributed in the homogeneous background medium from dynamic measurements of electromagnetic fields performed at the medium boundary during a finite time interval. The elaboration of this algorithm relies on the use of finite element solution of Maxwell's equations, on an exact controllability method and on a Fourier inversion in order to localize the inclusion centers. The main result consists of a computational algorithm and its corresponding software, which could be of use for solving a larger specter of problems in Non-Destructive Testing, Medical Imaging and Hazardous Material Detection
Macario-Rat, Gilles. "Cryptanalyse de schémas multivariés et résolution du problème Isomorphisme de Polynômes." Paris 7, 2010. http://www.theses.fr/2010PA077067.
Multivariate cryptography is a field of research where has appeared a rich family of cryptographic schemes based on hardness of the Multivariate Quadratic Problem which goal is the resolution of an average System of multivariate polynomials. Among those schemes are C*, SFLASH, HFE, UOV, etc. The purpose of this thesis is a presentation of recent works of cryptanalysis of some of these schemes. In a first part, common properties of those schemes are described and exploited, such as the fact that the differentials of the public coordinates hold a characteristic equation for conjugales of multiplications and one of the secret transformations. The main result is the resolution of the Isomorphism of Polynomial Problem related to the corresponding schemes. In a second part, a new analysis approach is presented, based on the computation of kernel of pencils of differentials derived from the polynomials of the public key, which leads for the SFLASH scheme to the direct recovery of the secret decomposition from merely three public coordinates and with a low polynomial complexity
Smith, Schneider Paulo. "Comportement thermo-aéraulique des bâtiments : : stratégies de résolution du problème couplé." Lyon, INSA, 1994. http://www.theses.fr/1994ISAL0095.
The starting point of this work is the knowledge and the analysis of the different strategies of resolving the Air Flow-Thermal sets of equations applied to building physics. The question we were faced to was: which is the best strategy of resolution to a specific problem? In order to tr to answer this question we developped COBRA. Many case studies were created to observe the answers of the strategies face to different situations. The analysis of the simulations allowed us to propose an expert use of the strategies, where the main points were the computational efforts needed to build up the routines, the dimensions of the resulting equation sets , the manegent of some numerical parameters, the compatibility with other simulation softwares and the quality of the results
Atahran, Ahmed. "Etude et résolution d'un problème de transport à la demande multicritère." Thesis, Tours, 2012. http://www.theses.fr/2012TOUR4035/document.
The work presented in this thesis aims to propose methods to solve a multicriteria dial-a-ride problem (DARP). Three objective functions that have to be optimized in order to measure the potential efficiency of the DARP solution on different aspects : the cost for the transportation operator, the quality of service for users and the impact on the environment. The first work in this thesis is the study of static DARP for which a NSGA-II algorithm is developped to identify a good approximation of the Pareto optimal set. The second work deals with an optimal timing algorithm which computes pickup and delivery dates when the requests are sequenced on the vehicles, the objective is to minimize the total customer' dissatisfaction. The last problem studied in this thesis aims to solve the dynamic version of DARP for which two methods are proposed. The first one is a fast insertion heuristic based on an attractive index. However, the second methode uses a recovering beam search heuristic which unlike the insertion heuristic allows to modify the structure of the routes previously scheduled in order to schedule the new requests
Kueviakoe, Kangni. "Localisation multi-capteurs garantie : résolution d'un problème de satisfaction de contraintes." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112241/document.
This thesis deals with the vehicle locationand addresses the problem of SLAM (simultaneous localization and mapping). Several methods are used to solve this kind of problem. They can be classified into two broad categories of approaches: probabilistic approach and deterministic approaches. This work addresses the deterministic approaches and more precisely the approach based on interval analysis. The work has been conducted on real data sets collected in outdoor environments with proprioceptive and exteroceptive sensors.When multiple sensors providing complementary or redundant information are put into play, it is important to merge the data to improve the estimated pose. The approach detailed in this document uses the intervals methods and presents the localization problem as a constraint satisfaction problem.The resolution is done using a solver interval. Several solvers were compared. One thing is clear: local consistency algorithms do not address the uncertainty of the orientation. This thesis proposes a method of locating usable in real time applications and corrects the uncertainty in the heading of the vehicle. We compared our results with those of the extended Kalman filter (probabilistic reference method) and highlighted one of the interests of our method: the assurance of consistency of the pose (position and orientation of the mobile).This thesis proposes two contributions. The first is methodological. In the state of the art all works affirm the need (or obligation) to pre-decompose the constraints of the problem before the resolution step. Our work allows to prove otherwise. The second contribution relates to the reduction of the orientation uncertainty by combining constraint propagation and a bisection approach
Ternier, Ian-Christopher. "Résolution exacte du Problème de Coloration de Graphe et ses variantes." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED060/document.
Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a color to each vertex of the graph such that two adjacent vertices do not share the same color and the total number of colors is minimized. DSATUR is an effective exact algorithm for the VCP. We introduce new lower bounding techniques enabling the computing of a lower bound at each node of the branching scheme. Our new DSATUR outperforms the state of the art for random VCP instances with high density, significantly increasing the size of solvable instances. Similar results can be achieved for a subset of high density DIMACS instances. We study three ILP formulations for the Minimum Sum Coloring Problem (MSCP). The problem is an extension of the classical Vertex Coloring Problem in which each color is represented by a positive natural number. The MSCP asks to minimize the sum of the cardinality of subsets of vertices receiving the same color, weighted by the index of the color, while ensuring that vertices linked by an edge receive different colors. We focus on studying an extended formulation and devise a complete Branch-and-Price algorithm
Martinez, David. "Résolution interactive de problèmes de satisfaction de contraintes." Toulouse, ENSAE, 1998. http://www.theses.fr/1998ESAE0005.
Camus-Musquer, Agnès. "Pour une approche pédagogique et didactique de la résolution de problèmes arithmétiques chez les élèves de CE2 : du processus de symbolisation à l'activité de schématisation réfléchie." Nantes, 2007. http://www.theses.fr/2007NANT3003.
The learning of mathematics and particularly the solving of arithmetic problems is based more often than not on the quality of its representation that the pupils build in their mind. The closer the representation of the problem in pupils’ minds is to the task in hand, the more relevant is the solving of this problem. However, some behavioural deficiencies in the learning process, such as the ability to explore to compare, to infer and to check prevent the creation of any organized problem solving. The realization that the procedure demands an association of the abstract and the concrete through symbols forms the basis of a well-thought-out schematization. It is this that we must consider when experimenting with the teaching and educational conditions likely to encourage the use of the four learning process required to the construction of viable problem-solving space. This thesis aims at organizing the activity of a “thought-out schematization of problems” by distinguishing the teaching and the educational elements. The experimental devices put into play reveal positive consequences and repercussions of a thought –out schematization on the solving of arithmetic problems. This , until now, new activity also brings to light a new approach to teaching “arithmetic problems “ by taking into account four elements :the learner, the subject or situation in this case of arithmetic problems, the learning process, and also teaching skills
Safa, Cyril. "Résolution rapide d'équations intégrales pour un problème d'antennes par des méthodes d'ondelettes." Phd thesis, Université Rennes 1, 2001. http://tel.archives-ouvertes.fr/tel-00006317.
Lebel, Michel. "Impact de deux variantes de l'idéation lors de la résolution d'un problème." Mémoire, Université de Sherbrooke, 1985. http://hdl.handle.net/11143/7796.
Bellenguez-Morineau, Odile. "Méthodes de résolution pour un problème de gestion de projet multi-compétence." Tours, 2006. http://www.theses.fr/2006TOUR4019.
This document deals with the multi-skill project scheduling problem: a project has to be scheduled in order to minimize the makespan. The resources may master several skills among all those needed by activities. First of all, we introduce the problem by a formal definition, and a linear program. Then, according to differences with other classical project scheduling problems, we develop specific methods. Several lower bounds are introduced. Then, we define some heuristic methods based on: serial schedule scheme or parallel schedule scheme, which use a priority list. Those methods are followed by a linear programming formulation, and some meta-heuristic method: a tabu search and two genetic algorithms. Finally, we introduce a branch-and-bound procedure to build optimal solutions. The branching scheme is based on time-windows of activities. So, each time a leaf node is reached, a fixed job scheduling problem with multiple skills has to be solved. We use some methods to optimally solve this problem, which are detailed in this document
Berroug, Mohamed. "Contribution à la résolution du problème d'intersection de deux carreaux de surfaces." Metz, 1995. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/1995/Berroug.Mohamed.SMZ9534.pdf.
The research of intersection curves of two parametric surfaces is one of the most delicat and indisponsable operation for modeling complex shapes. The difficulties are : tangentiel intersection, small loops and the representation of the intersection by a piecewise linear approximation. In this thesis, we developp the two existant methods : recursive subdivision and tracing methods. For the first, we developp the two tests defining the method : separating and flatness tests. We had implement the method in many versions. An experimental implentation helps us to choose the best one. For the second method, we developp a tracing procedure for regular curves using the intrinsic proprities of the treated curve. The use of the notion of oriented function distance and the strategy of the recurive subdivision method permet to treat tangential intersection (isolated and simple) and small loops are treated
Bennaceur, Hachemi. "Le Problème de satisfaction de contraintes : synthèse et méthode exacte de résolution." Paris 13, 1989. http://www.theses.fr/1989PA132025.
Filosa, Christopher. "Tomographie muonique : du développement de détecteurs à la résolution du problème inverse." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS506.
This thesis presents the development of Micromegas gaseous detectors for muon tomography. This technique use cosmic muons, resulting from interactions between cosmic rays and the atmosphere to image objects of large dimensions and opacity such as buildings, concrete slabs, volcanoes or pyramids such as the Khufu's pyramid in Egypt. By studying the attenuation of the muon flux through objects, we can access their internal structure. To image such structures and detect muons passing through them, muon telescopes using Micromegas detectors are used. Many efforts have been developed during this thesis to improve the spatial resolution and gas performance of the latter.One of the main goal of this thesis is to image a concrete slab, which dimensions were 2000 mm x 1000 mm x 500 mm. Firstly, a study on the detection of defects in this slab was carried out. Thanks to an algorithm developed during this thesis, a 15cm wide default can be detected with a 98% confidence level from 4h of data collection. Subsequently, a two-dimensional feasibility study, in the plan of the slab length, was carried out in order to reconstruct the density map of the concrete slab. To do this, we need to solve what is commonly referred to as the inverse problem: estimating the parameters of an object based on the data collected. Here the density of the concrete slab will play the role of parameters to be estimated and the flux of muons that have passed through the slab and collected by our detectors will play the role of data. After analysing the different systematic problem analyses, we can reconstruct the density of a concrete slab, with a thickness resolution of 125mm and a length resolution of 437.5mm, with a maximum relative error of 12%
Guo, Zhiyi. "Résolution heuristique et optimale du problème de localisation de dépôts avec équilibrage." Châtenay-Malabry, Ecole centrale de Paris, 1990. http://www.theses.fr/1990ECAP0160.