Sökning: "Combinatorial Optimization"
Visar resultat 1 - 5 av 70 avhandlingar innehållade orden Combinatorial Optimization.
Sammanfattning : Combinatorial optimization is a diverse area of mathematics. It concerns optimization on feasible regions defined by discrete sets, graphs, hypergraphs, matroids, etc. . . LÄS MER
Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER
3. Application of the quantum approximate optimization algorithm to combinatorial optimization problems
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
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
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