698 search results - page 27 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
SIAMCOMP
1998
13 years 9 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
CP
2003
Springer
14 years 2 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
ICCS
2007
Springer
14 years 3 months ago
2007
Springer
Electric power transmission systems are comprised of a large number of physical assets, including transmission lines, power transformers, and circuit breakers, that are capital-int...
GECCO
2000
Springer
14 years 28 days ago
2000
Springer
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
AIPS
2011
13 years 28 days ago
2011
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...