# Search for dissertations about: "combinatorial search"

Showing result 1 - 5 of 32 swedish dissertations containing the words combinatorial search.

1. ## 1. Set Constraints for Local Search

University dissertation from Uppsala : Acta Universitatis Upsaliensis

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

2. ## 2. Combinatorial Optimization for Infinite Games on Graphs

University dissertation from Uppsala : Acta Universitatis Upsaliensis

Abstract : 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. READ MORE

3. ## 3. Engineering Competitive and Query-Optimal Minimal-Adaptive Randomized Group Testing Strategies

University dissertation from Gothenburg : Chalmers tekniska högskola

Abstract : Suppose that given is a collection of $n$ elements where $d$ of them are \emph{defective}. We can query an arbitrarily chosen subset of elements which returns Yes if the subset contains at least one defective and No if the subset is free of defectives. The problem of group testing is to identify the defectives with a minimum number of such queries. READ MORE

4. ## 4. Rational and combinatorial genetic engineering approaches for improved recombinant protein production and purification

University dissertation from Stockholm : Bioteknologi

Abstract : The bacterium Escherichia coli (E. coli) is in many situations an ideal host for production of recombinant proteins, since it generally provides a rapid and economical means to achieve sufficiently high product quantities. READ MORE

5. ## 5. High-level modelling and local search

University dissertation from Uppsala University

Abstract : Combinatorial optimisation problems are ubiquitous in our society and appear in such varied guises as DNA sequencing, scheduling, configuration, airline-crew and nurse rostering, combinatorial auctions, vehicle routing, and financial portfolio design. Their efficient solution is crucial to many people and has been the target for much research during the last decades. READ MORE