Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Computationally difficult problems"”.
-
Juiciness in Citizen Science Computer Games: Analysis of a Prototypical Game
… science games leverage puzzles to present computationally difficult problems to players. Such games typ- ically map the scientific problem to game mechanics and visual feed-back helps players improve their solutions. Like games for entertainment, citizen science games intend to capture and …
-
Quasim: Quantum Circuit Simulation - Design and Implementation of a Rust library enabling construction, inspection and execution of quantum circuits
… the world, bringing new approaches to solving computationally difficult problems. The basic computational unit of quantum computers is called qubit. Because qubits can exist in a super-position of both 0 and 1 simultaneously, quantum computers have the capacity to let us execute algorithms that …
-
A probabilistic architecture for algorithm portfolios
… logical reasoning are increasingly successful on computationally difficult problems such as satisfiability, and these solvers enable applications from circuit verification to software synthesis. Whether a problem instance can be solved, however, often depends in practice on whether the correct …
-
Parallel approaches for the the vehicle routing problem
<p>Vehicle routing problems (VRPs) are known to be computationally intractable. The time required to solve a VRP increases significantly given a modest increase in problem size. Only small VRPs are optimally solved using existing solution approaches on single processor computers.</p> <p>In recent …
-
Submodular Maximization Subject to Information Constraints
… submodular maximization is relevant in many problems in controls, robotics and machine learning, because it models many computationally difficult problems. A simple greedy strategy can provide strong approximation guarantees for many of these problems. We wish to expand the set of scenarios …
-
Monte Carlo methods for multi-stage stochastic programs
… effectively utilized for analyzing optimization problems when the problem’s parameters are not known with certainty. These uncertain parameters are treated as a random vector with a known distribution in the stochastic programming framework. Typically, the size of stochastic programming models is …