Teses / dissertações sobre o tema "Satisfaction de problèmes de contraintes"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Satisfaction de problèmes de contraintes".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.
Bellicha, Félix Amit. "Flexibilité dans les problèmes de satisfaction de contraintes". Montpellier 2, 1996. http://www.theses.fr/1996MON20265.
Texto completo da fonteMartinez, David. "Résolution interactive de problèmes de satisfaction de contraintes". Toulouse, ENSAE, 1998. http://www.theses.fr/1998ESAE0005.
Texto completo da fonteHamadi, Youssef. "Traitement des problèmes de satisfaction de contraintes distribués". Montpellier 2, 1999. http://www.theses.fr/1999MON20097.
Texto completo da fonteTounsi, Mohamed. "Contribution à la résolution des problèmes de satisfaction de contraintes discrets". Nantes, 2002. http://www.theses.fr/2002NANT2056.
Texto completo da fonteLesaint, David. "Calcul d'ensembles de solutions pour problèmes de satisfaction de contraintes". Toulouse, ENSAE, 1995. http://www.theses.fr/1995ESAE0006.
Texto completo da fonteMadelaine, Florent. "Problèmes de satisfaction de contraintes : une étude logique et combinatoire". Caen, 2003. http://www.theses.fr/2003CAEN2005.
Texto completo da fonteRiff-Rojas, Maria-Cristina. "Résolution de problèmes de satisfaction de contraintes avec des algorithmes évolutionnistes". Phd thesis, Ecole Nationale des Ponts et Chaussées, 1997. http://tel.archives-ouvertes.fr/tel-00523169.
Texto completo da fonteVion, Julien. "Contributions à la résolution générique des problèmes de satisfaction de contraintes". Phd thesis, Université d'Artois, 2007. http://tel.archives-ouvertes.fr/tel-00262080.
Texto completo da fontePar ailleurs, nous avons également cherché à améliorer MGAC, tout d'abord en équipant celui-ci d'heuristiques de choix de valeurs. Nous nous sommes pour cela basés sur l'heuristique de Jeroslow-Wang, issue du problème SAT. En utilisant deux techniques de conversion de CSP vers SAT, nous montrons comment cette heuristique se comporterait sur un CSP. Enfin, nous avons cherché à utiliser une hybridation entre un algorithme de recherche locale basé sur la pondération des contraintes et un algorithme MGAC équipé de l'heuristique dom/wdeg, en exploitant les possibilités d'apprentissage de l'un et l'autre algorithmes.
De manière transversale, l'ensemble des techniques développées dans le cadre de cette thèse a amené à la réalisation d'une API pour le langage Java, capable de résoudre un CSP au sein d'une application Java quelconque. Cette API a été développée dans l'optique "boîte noire" : le moins de paramètres et d'expertise possibles sont demandés à l'utilisateur. Un prouveur basé sur CSP4J a concouru lors les compétitions internationales de prouveurs CSP avec des résultats encourageants.
Fargier, Hélène. "Problèmes de satisfaction de contraintes flexibles. Application à l'ordonnancement de production". Toulouse 3, 1994. http://www.theses.fr/1994TOU30099.
Texto completo da fonteButaru, Mihaela. "Problèmes de satisfaction de contraintes n-aires : résolution séquentielle et parallèle". Metz, 2005. http://www.theses.fr/2005METZA001.
Texto completo da fonteGhédira, Khaled. "Masc : une approche multi-agents des problèmes de satisfaction de contraintes". Toulouse, ENSAE, 1993. http://www.theses.fr/1993ESAE0027.
Texto completo da fonteJohannsen, Schnoor Ilka. "La méthode des bases faibles pour les problèmes de satisfaction de contraintes". Aix-Marseille 2, 2007. http://www.theses.fr/2007AIX22109.
Texto completo da fonteConstraint satisfaction problems are an important class of problems in complexity theory. The computational complexity of all boolean constraint satisfaction problems was completely classified by Schaefer in 1978 using algebraic tools involving a Galois correspondance. However, for many problems related to constraint satisfaction these tools cannot be applied. We develop a method that allows to use a refined Galois correspondence to obtain complexity classifications for those problems. We demonstrate our new method by completely classifying two constraint problems from different contexts: first we consider the balanced satisfiability problem, where we require the solutions to satisfy a global condition additionally to the local constraints given in the constraint instance. Then we turn to nonmonotonic logics and study the complexity of reasoning in default logic restricted to constraint formulas. Finally we study the problem of enumerating all solutions of given constraint instances over arbitrary finite domains and present a template for new efficient enumeration algorithms
Prcovic, Nicolas. "Recherche arborescente parallèle et séquentielle pour les problèmes de satisfaction de contraintes". Marne-la-vallée, ENPC, 1998. http://www.theses.fr/1998ENPC9812.
Texto completo da fonteAmilhastre, Jerome. "Représentation par automate d'ensemble de solutions de problèmes de satisfaction de contraintes". Montpellier 2, 1999. http://www.theses.fr/1999MON20027.
Texto completo da fonteCastro, Carlos. "Une approche déductive de la résolution de problèmes de satisfaction de contraintes". Nancy 1, 1998. http://docnum.univ-lorraine.fr/public/SCD_T_1998_0236_CASTRO.pdf.
Texto completo da fonteDavid, Philippe. "Prise en compte de la sémantique dans les problèmes de satisfaction de contraintes : étude des contraintes fonctionnelles". Montpellier 2, 1994. http://www.theses.fr/1994MON20038.
Texto completo da fonteBerger, Nicolas. "Modélisation et résolution en programmation par contraintes de problèmes mixtes continu/discret de satisfaction de contraintes et d'optimisation". Phd thesis, Université de Nantes, 2010. http://tel.archives-ouvertes.fr/tel-00560963.
Texto completo da fonteMadeline, Blaise. "Algorithmes évolutionnaires et résolution de problèmes de satisfaction de contraintes en domaines finis". Phd thesis, Université de Nice Sophia-Antipolis, 2002. http://tel.archives-ouvertes.fr/tel-00505450.
Texto completo da fonteHadjadj, Aoul Lamia. "Sur des généralisations des graphes triangulés : application aux problèmes de satisfaction de contraintes". Aix-Marseille 1, 2003. http://www.theses.fr/2003AIX11025.
Texto completo da fonteTerrioux, Cyril. "Approches structurelles et coopératives pour la résolution des problèmes de satisfaction de contraintes". Aix-Marseille 1, 2002. http://www.theses.fr/2002AIX11051.
Texto completo da fonteGouachi, Idir. "Liresne : Un système de Résolution de problèmes de satisfaction de contraintes en nombres entiers". Paris 13, 1998. http://www.theses.fr/1998PA132023.
Texto completo da fonteMerchez, Sylvain. "Problèmes de satisfaction de contraintes : étude de mécanismes d'abstraction et de construction de hiérarchies". Artois, 2000. http://www.theses.fr/2000ARTO0405.
Texto completo da fonteLagniez, Jean-Marie. "Satisfiabilité propositionnelle et raisonnement par contraintes : modèles et algorithmes". Thesis, Artois, 2011. http://www.theses.fr/2011ARTO0404/document.
Texto completo da fonteThis thesis deals with propositional satisfiability (SAT) and constraint satisfaction problems(CSP). These two declarative models are widely used for solving several combinatorial problems (e.g.formal verification of hardware and software, bioinformatics, cryptography, planning, scheduling, etc.).The first contribution of this thesis concerns the proposition of hybridization schemes of complete andincomplete methods, giving rise to an original answer to a well-known challenge open since 1998. Secondly,a new and efficient multi-core parallel approach is proposed. In the third contribution, a novelapproach for improving clause learning management database is designed. This contribution allows spatialcomplexity reduction of the resolution-based component of SAT solvers while maintaining relevantconstraints. This contribution was awarded at the last international SAT conference (best paper award).This work has led to several open sources solving tools for both propositional satisfiability and constraintssatisfaction problems
Cervoni, Laurent. "Méthodologies et techniques de résolution de problèmes avec contraintes. Application en programmation logique avec objets : cooxi". Rouen, 1994. http://www.theses.fr/1994ROUES032.
Texto completo da fonteKaroui, Wafa. "Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire". Thesis, Toulouse, INSA, 2010. http://www.theses.fr/2010ISAT0021/document.
Texto completo da fonteThe CSP (Constraint Satisfaction Problem) formalism can be considered as a simple example of a formal representation language covering all problems including constraints. The advantage of this formalism consists in the fact that it allows powerful general-purpose algorithms as much as useful specific algorithms.In this PhD thesis, we study several tree search methods for solving CSPs and focus on ones based on the discrepancy concept (a discrepancy is a deviation from the first choice of the heuristic). In this context, we propose improving mechanisms for general methods. These mechanisms take benefits from conflicts and guide the search by weighting the variables and the values. We propose also special mechanisms for methods based on discrepancies as the discrepancies restriction, the discrepancies counting, and the discrepancies positions. All propositions are validated by experiments done on real and random CSPs. We compare variants of methods based on discrepancies integrating several combinations of improvements and other methods known for their efficiency.In a second part, we extend our propositions to an optimisation context considering scheduling problems with time lags. In this purpose, we adapt a discrepancy-based method, Climbing Discrepancy Search, to solve these problems. Efficiency of some improved variants of this method is tested on known benchmarks
Karaoui, Wafa. "Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire". Phd thesis, INSA de Toulouse, 2010. http://tel.archives-ouvertes.fr/tel-00538672.
Texto completo da fonteJégou, Philippe. "Contribution à l'étude des problèmes de satisfaction de contraintes : algorithmes de propagation et de résolution : propagation de contraintes dans les réseaux dynamiques". Montpellier 2, 1991. http://www.theses.fr/1991MON20015.
Texto completo da fonteMérel, Pierre-Paul. "Les problèmes de satisfaction de contraintes : recherche n-aire et parallélisme : application au placement en CAO". Metz, 1998. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/1998/Merel.Pierre_Paul.SMZ9806.pdf.
Texto completo da fonteConstraint satisfaction problems (CSP) are a powerfull framework in formalization of artificial intelligence problems. A CSP is given by a set of variables defined on specific domains, and a set of constraints on these variables. Many technics had been defined to solve them. We are interested in this document, in complete methods, i. E. Enabling to find a solution in every case. The most powefull complete solving methods for CSP use a search mecanism with forward checking consistency, i. E. In filtering incompatible values in not yet instantiated domains when a new instantiation is tested. However, these methods are defined only for binary constraints. We extend them in defining a generalized notion of n-ary consistency : relationnal-(I,J)-consistency. Our experimentations show direct n-ary search is faster than search on binary CSP sfter transformation. As sequential search is rather costly (NP-complete), parallelism enables to reduce computation time. To achieve this, we define a generic algorithm allowing to mix different sequential search and parallelization methods. Global principle of resolution is based on “OR-parallel” search. If most of classical parallel technics are usable for CSP, we define different technics to follow CSP specificities. Thus, we propose a load sharing method, a splitting technics adapted for the size of search contexts and a function to evaluate the divisibility of a task. We apply and specialize our algorithms in solving the problem of cutting plan, i. E. Position asignement for random pieces on a restricted area
Trojet, Mariem. "Planification d'une chaîne logistique : approche par satisfaction de contraintes dynamiques". Phd thesis, INSA de Toulouse, 2014. http://tel.archives-ouvertes.fr/tel-00996957.
Texto completo da fonteRochon, du Verdier Franck. "Résolution de problèmes d'aménagement spatial fondée sur la satisfaction de contraintes : validation sur l'implantation d'équipements électroniques hyperfréquences". Lyon 1, 1992. http://www.theses.fr/1992LYO10141.
Texto completo da fonteRichoux, Florian. "Toward a complexity classification of CSP through kernel widthVers une caractérisation de la complexité des CSP à travers la largeur des kernels". Palaiseau, Ecole polytechnique, 2009. http://pastel.paristech.org/5564/01/memoire_submitted.pdf.
Texto completo da fonteDaoudi, Abderrazak. "Acquisition de contraintes par apprentissage de structures". Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT316/document.
Texto completo da fonteConstraint Programming is a general framework used to model and solve complex combinatorial problems.However, modeling a problem as a constraint network requires significant expertise in the field.Such level of expertise is a bottleneck to the broader uptake of the constraint technology.To alleviate this issue, several constraint acquisition systems have been proposed to assist thenon-expert user in the modeling task. Nevertheless, in these systems the user is only asked to answervery basic questions. The drawback is that when no background knowledge is provided,the user may need to answer a large number of such questions to learn all the constraints.In this thesis, we show that using the structure of the problem under consideration may improvethe acquisition process a lot. To this aim, we propose several techniques.Firstly, we introduce the concept of generalization query based on an aggregation of variables into types.Secondly, to deal with generalization queries, we propose a constraint generalization algorithm, named GENACQ, together with several strategies. Thirdly, to make the build of generalization queries totally independent of the user, we propose the algorithm MINE&ASK, which is able to learn the structure, during the constraint acquisition process, and to use the learned structure to generate generalization queries. Fourthly, toward a generic concept of query, we introduce the recommendation query based on the link prediction on the current constraint graph. Fifthly, we propose a constraint recommender algorithm, called PREDICT&ASK, that asks recommendation queries, each time the structure of the current graph has been modified. Finally, we incorporate all these new generic techniques into QUACQ algorithm leading to three boosted versions, G-QUACQ, M- QUACQ, and P-QUACQ. To evaluate all these techniques, we have made experiments on several benchmarks. The results show that the extended versions improve drastically the basic QUACQ
Arsouze, Julien. "Une formalisation de la résolution des problèmes de satisfaction de contraintes : application à la vision grammaticale de CLP". Orléans, 2004. http://www.theses.fr/2004ORLE2073.
Texto completo da fonteDago, Pierre. "Extension d'algorithmes dans le cadre des problèmes de satisfaction de contraintes valués : application à l'ordonnancement de systèmes satellitaires". Toulouse, ENSAE, 1997. http://www.theses.fr/1997ESAE0006.
Texto completo da fonteLobjois, Lionel. "Problèmes d'optimisation combinatoire sous contraintes : vers la conception automatique de méthodes de résolution adaptées à chaque instance". Toulouse, ENSAE, 1999. http://www.theses.fr/1999ESAE0025.
Texto completo da fonteKueviakoe, 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.
Texto completo da fonteThis 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
Naanaa, Wady. "Résolution de problèmes de satisfaction de contraintes intégrant la flexibilité et la symétrie : application à la génération de structures moléculaires". Lyon 1, 1996. http://www.theses.fr/1996LYO10320.
Texto completo da fonteVautard, Jérémie. "Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées". Phd thesis, Université d'Orléans, 2010. http://tel.archives-ouvertes.fr/tel-00486721.
Texto completo da fonteBudzynski, Louise. "Algorithmic barriers in random constraint satisfaction problems". Thesis, Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLE013.
Texto completo da fonteThe typical complexity of Constraint Satisfaction Problems (CSP) can be studied using random ensembles of instances. One observes threshold phenomena when the density of constraints increases, in particular a clustering phase transition at which typical solutions shatter into disconnected components. In this PhD, we introduce a bias that breaks the uniformity among solutions of a given instance of CSP, and look at the evolution of the clustering threshold under this bias, focusing on the bicoloring of k-uniform random hypergraphs. For small values of k, we show that this bias can delay the clustering transition to higher densities of constraints, and that it has a positive impact on the performances of Simulated Annealing algorithm to find a solution for a given instance of the bicoloring problem. In the large k limit, we compute the asymptotic expansion of the clustering threshold for the uniform and the biased measure, and characterize the gain obtained with our implementation of the bias
Escamocher, Guillaume. "Forbidden patterns in constraint satisfaction problems". Toulouse 3, 2014. http://thesesups.ups-tlse.fr/2283/.
Texto completo da fonteThe Constraint Satisfaction Problem (CSP) is NP-Complete, even in the case where all constraints are binary. However, some classes of CSP instances are tractable. Recently, a new method for defining such classes has emerged. This approach is centered around forbidden patterns, or the local absence of some conditions. It is the focus of my thesis. We formally define what forbidden patterns are, exhibit the properties they hold, and eventually put them to use in order to establish several important tractability results. Using different versions of patterns, all based on the same core concept, we list a significant number of new tractable classes, as well as some NP-Complete ones. We combine these results to reveal several dichotomies, each one encompassing a large range of classes of CSP instances. We also show how useful a tool forbidden patterns can be in the field of CSP instance simplification. We give multiple new ways of decreasing the size of CSP instances, whether by eliminating variables or fusioning domains, and prove how all these methods are enabled by the local absence of some patterns. Since the conditions for their use are entirely local, our operations can be used on a wide array of problems
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.
Texto completo da fonteVerdret, Philippe. "L'expertise en conception de programme : Approche à partir de la notion de satisfaction de contraintes". Rouen, 1989. http://www.theses.fr/1989ROUEL082.
Texto completo da fonteTo characterize expertise in Shell program design, one expert and three experienced programmers were observed while designing a "script", i. E. A program written with the UNIX Shell command language. Script design was analyzed as a constraint-management process. The process consists of identifying design constraints. Constraints are especially criteria to be satisfied by the design produc (i. E. The script). Various constraint-management strategies were identified. They are: relaxing, isolating, hierarchizing, and integrating constraint structures. The shell design process revealed three successive steps: understanding the problem, planning the solution, and implementing the solution. This breaking down is all the more apparent since the programmer is expert. The study of planning brought to light two modalities of solution elaborating. While experienced programmers integrate constraints identified progressively, expert programmer integrates a lot of constraints straightaway thanks to language-related knowledge structures representing procedure abstractions. The study of implementation showed that the expert uses a set of techniques which allows him to isolate constraints and to avoid interactions conquently. Expert script design is made from design units which constitute script templates. Templates satisfy more constraints than the only constraints of script operationality which were rather considered by experienced programmers. The templates are progressively fitted to context of use through editing executing phrases. In conclusion, theoretical and practical implications of the study are briefly considered
Lamontagne, Éric. "Le problème de décision CSP : Homomorphismes et espace logarithmique". Thesis, Université Laval, 2012. http://www.theses.ulaval.ca/2012/29292/29292.pdf.
Texto completo da fonteSaad, Belaïd. "Intégration des problèmes de satisfaction de contraintes distribués et sécurisés dans les systèmes d'aide à la décision à base de connaissances". Thesis, Metz, 2010. http://www.theses.fr/2010METZ012S/document.
Texto completo da fonteA wide range of practical problems requires diversity of data representation and to develop models in which different data can be represented. In this thesis, we focus on the hybridization of two models: Expert System (ES) and Constraint Satisfaction Problem (CSP).The aim of our work is to propose a secure distributed system that allows integrating constraints in an inference engine.To reach this goal, on one hand we developed a communication tool that facilitates collaboration between ES and CSP. On the other hand, we designed an algorithm that allows communication between multiple entities in a distributed environment. Finally, one of our goals, not the least, is to protect private data of each entity. The thesis is composed of three main axes.The first priority is to develop a method of communication between the two models. First, we describe an automatic transformation procedure of the rule based expert system into the new dynamic CSP model called DDCSP (Dynamic Domain CSP) that we have designed. This procedure will automatically transform and inject the result of one of the two models as input to the other one. This process plays an essential role for collaboration based on the exchange of information.Our second axe proposes an algorithm based on the concept of cooperation and parallelism which provides a resolution distributed among several entities. Our approach is to build a ring of autonomous agents, each responsible for some of the variables and constraints of the problem. Each of these agents will initiate a process that explores a different branch of the search tree. Heuristics are proposed to ensure a diversification of exploration, in other words to prevent overlapping of the explored branches.Finally, we present a technique for securing this distributed algorithm based on a judicious use of the properties of asymmetric encryption to protect the confidentiality of instantiations. To perform an experimental validation of our work, an implementation in the programming languages C/C++ or Java is described in each of these three axes
Paris, Nicolas. "Intégration de techniques CSP pour la résolution du problème WCSP". Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0405/document.
Texto completo da fonteThis 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
Gharbi, Nebras. "On compressing and parallelizing constraint satisfaction problems". Thesis, Artois, 2015. http://www.theses.fr/2015ARTO0406/document.
Texto completo da fonteConstraint Programming (CP) is a powerful paradigm used for modelling and solving combinatorial constraint problems that relies on a wide range of techniques coming from artificial intelligence, operational research, graph theory,..., etc. The basic idea of constraint programming is that the user expresses its constraints and a constraint solver seeks a solution. Constraint Satisfaction Problems (CSP), is a framework at the heart of CP problems. They correspond to decision problems where we seek for states or objects satisfying a number of constraints or criteria. These decision problems have two answers to the question they encode: true, if the problem admits a solution, false, otherwise. CSPs are the subject of intense research in both artificial intelligence and operations research. Many CSPs require the combination of heuristics and combinatorial optimization methods to solve them in a reasonable time.With the improvement of computers, larger and larger problems can be solved. However, the size of industrial problems grow faster which requires a vast amount of memory space to store them and entail great difficulties to solve them. In this thesis, our contributions can be divided into two main parts. In the first part, we deal with the most used kind of constraints, which are table constraints. We proposed two compressed forms of table constraints. Both of them are based on frequent patterns search in order to avoid redundancy. However, the manner of defining pattern, the patterns-detecting process and the new compact representation differ significantly. For each form, we propose a filtering algorithm. In the second part, we explore another way to optimize CSP solving which is the use of a parallel architecture. In fact, we enhance the solving process by establishing parallel consistencies. Different workers send to their master the result of establishing partial consistencies as new discovered facts. The master, in its turns tries to benefit from them by removing corresponding values
Thierry, Caroline. "Planification et ordonnancement multi-site : une approche par satisfaction de contraintes". Toulouse, ENSAE, 1994. http://www.theses.fr/1994ESAE0025.
Texto completo da fonteJanssen, Philippe. "Aide à la conception : une approche basée sur la satisfaction de contraintes". Montpellier 2, 1990. http://www.theses.fr/1990MON20039.
Texto completo da fonteGivry, Simon de. "Algorithmes d'optimisation sous contraintes étudiés dans un cadre temps réel". Toulouse, ENSAE, 1998. http://www.theses.fr/1998ESAE0002.
Texto completo da fonteAnglada, Alexis. "Introduction de mécanisme de flexibilité dans la programmation par contraintes sur les domaines continus". Paris 6, 2005. http://www.theses.fr/2005PA066261.
Texto completo da fonte