Sökning: "combinatorial search"
Visar resultat 1 - 5 av 37 avhandlingar innehållade orden combinatorial search.
1. From Declarative Models to Local Search
Sammanfattning : A solver is a general-purpose software for solving optimisation problems. It takes as input a description of a problem, called a model, and uses a collection of algorithms, called its solving technology, to ideally produce an optimal solution as output. Most solvers have a modelling language that cannot be processed by other solvers. LÄS MER
2. Set Constraints for Local Search
Sammanfattning : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. LÄS MER
3. Combinatorial Slice Theory
Sammanfattning : Slices are digraphs that can be composed together to form larger digraphs.In this thesis we introduce the foundations of a theory whose aim is to provide ways of defining and manipulating infinite families of combinatorial objects such as graphs, partial orders, logical equations etc. LÄS MER
4. Combinatorial Optimization for Infinite Games on Graphs
Sammanfattning : Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc. LÄS MER
5. Decomposition Methods for Combinatorial Optimization
Sammanfattning : This thesis aims at research in the field of combinatorial optimization. Problems within this field often posses special structures allowing them to be decomposed into more easily solved subproblems, which can be exploited in solution methods. These structures appear frequently in applications. LÄS MER
