1046 search results - page 87 / 210 » Approximation Algorithms for Domination Search |
113
click to vote
SIAMCOMP
2002
15 years 6 days ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
133
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
98
Voted
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
86
Voted
ATAL
2010
Springer
15 years 23 days ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
110
click to vote
NIPS
2003
15 years 1 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...