Search for dissertations about: "combinatorial search"

Showing result 21 - 25 of 37 swedish dissertations containing the words combinatorial search.

2. 21. Analysis, synthesis and application of automaton-based constraint descriptions

   Author : María Andreína Francisco Rodríguez; Justin Pearson; Pierre Flener; Christopher Jefferson; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint predicates; global constraints; automata; automaton-described constraint predicates; automaton-induced constraint decompositions; implied constraints; time-series constraints; transducers; automaton invariants; Computer Science; Datavetenskap;

   Abstract : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. READ MORE

4. 22. Strategies, Methods and Tools for Solving Long-term Transmission Expansion Planning in Large-scale Power Systems

   Author : Desta Zahlay Fitiwi; Lennart Söder; Michel Rivier; Fernando de Cuadra; Andres Ramos; KTH; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Transmission expansion planning; uncertainty and variability; optimization; stochastic programming; moments technique; clustering; Electrical Engineering; Elektro- och systemteknik;

   Abstract : Driven by a number of factors, the electric power industry is expected to undergo a paradigm shift with a considerably increased level of variable energy sources. A significant integration of such sources requires heavy transmission investments over geographically wide and large-scale networks. READ MORE

5. 23. Cost Propagation - Numerical Propagation for Optimization Problems

   Author : Birgit Grohe; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; optimization; numerical propagation; Cost propagation;

   Abstract : In this thesis, we investigate Cost Propagation,an approach to numerical propagation for optimization problems, where we combine ideas from both Constraint Programming and Combinatorial Optimization. We consider discrete optimization problems with binary variables that can be expressed in the model max_x sum_k g_k(x^k)where the terms g_k(x^k) are distinct arbitrary functions over subsets x^k of x. READ MORE

6. 24. Identifying Essential Deubiquitinase Interactions and Targeting Protein Ubiquitination in Cancer

   Author : Johannes Gubat; Padraig D´arcy; Stig Linder; Maria Turkina; Per Lindahl; Linköpings universitet; []
   Keywords : MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; Cancer; Deubiquitinase; b-AP15; Ubiquitin-proteasome system;

   Abstract : Cancer is the second leading cause of death globally and is one of the most pressing health issues today. While significant advances have been made in cancer treatment, drug resistance and toxicity remain formidable obstacles to successful therapy. Thus, there is a need to find novel targets that pave the way for new cancer therapeutics. READ MORE

7. 25. Using Genetic Algorithms for Large Scale Optimizationof Assignment, Planning and Rescheduling Problems

   Author : Irfan Younas; Anne Håkansson; Ender Özcan; KTH; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; SRA - ICT; SRA - Informations- och kommunikationsteknik;

   Abstract : There has always been a need to solve real-life large-scale problems, suchas efficiently allocating limited resources, and other complex and conflicting situations related to combinatorial optimization genre. A class of combinato- rial optimization problems is NP-hard and, among many well-known, several of them are assignment, planning and rescheduling problems. READ MORE