Search for dissertations about: "Search Algorithms"
Showing result 1 - 5 of 241 swedish dissertations containing the words Search Algorithms.
-
1. Lock-free Concurrent Search
Abstract : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. READ MORE
-
2. Set Constraints for Local Search
Abstract : 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. READ MORE
-
3. From Declarative Models to Local Search
Abstract : 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. READ MORE
-
4. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry
Abstract : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. READ MORE
-
5. Computational Issues in Calculi of Partial Inductive Definitions
Abstract : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. READ MORE