Sökning: "combinatorial problems"

Visar resultat 6 - 10 av 97 avhandlingar innehållade orden combinatorial problems.

1. 6. Application of the quantum approximate optimization algorithm to combinatorial optimization problems

   Författare :Pontus Vikstål; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; combinatorial optimization; quantum computing; Quantum approximate optimization algorithm;

   Sammanfattning : This licentiate thesis is an extended introduction to the accompanying papers, which encompass a study of the quantum approximate optimization algorithm (QAOA). It is a hybrid quantum-classical algorithm for solving combinatorial optimization problems and is a promising algorithm to run on near term quantum devices. LÄS MER

3. 7. Online Combinatorial Optimization under Bandit Feedback

   Författare :Mohammad Sadegh Talebi Mazraeh Shahi; Alexandre Proutiere; Vianney Perchet; KTH; []
   Nyckelord :Combinatorial Optimization; Online Learning; Multi-armed Bandits; Sequential Decision Making; Matematik; Mathematics; Datalogi; Computer Science;

   Sammanfattning : Multi-Armed Bandits (MAB) constitute the most fundamental model for sequential decision making problems with an exploration vs. exploitation trade-off. In such problems, the decision maker selects an arm in each round and observes a realization of the corresponding unknown reward distribution. LÄS MER

4. 8. On random satisfiability and optimization problems

   Författare :Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

   Sammanfattning : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. LÄS MER

5. 9. Combinatorial Optimization for Infinite Games on Graphs

   Författare :Henrik Björklund; Sergei Vorobyov; Erich Grädel; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; infinite games; combinatorial optimization; randomized algorithms; model checking; strategy evaluation functions; linear programming; iterative improvement; local search; Computer science; Datavetenskap;

   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

7. 10. Variational Methods in Combinatorial Optimization and Phylogeny Reconstruction

   Författare :Henrik Jönsson; Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; statistical physics; gravitation; relativity; annealing; variational; mean-field; phylogeny; constraint satisfaction; combinatorial optimization; maximum likelihood; Physics; Fysik; Mathematical and general theoretical physics; quantum mechanics; classical mechanics; klassisk mekanik; kvantmekanik; relativitet; statistisk fysik; termodynamik; Fysicumarkivet A:2001:Jönsson; Matematisk och allmän teoretisk fysik; thermodynamics;

   Sammanfattning : Algorithms based on the variational approach, as used in statistical physics, are developed. For constraint satisfaction problems a novel cost function, based on information-theoretic arguments, is introduced, and an algorithm similar to the mean-field annealing algorithm is proposed. LÄS MER