36 search results - page 1 / 8 » The Query Complexity of Finding Local Minima in the Lattice |
COLT
1998
Springer
13 years 9 months ago
1998
Springer
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
AAAI
2000
13 years 6 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...