2393 search results - page 49 / 479 » Bounds-Consistent Local Search |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
AIPS
2010
13 years 10 months ago
2010
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
STOC
2004
ACM
14 years 8 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...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...