Sciweavers

466 search results - page 30 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 1 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
AUSAI
2006
Springer
15 years 3 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
IJCAI
2003
15 years 1 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
SENSYS
2005
ACM
15 years 5 months ago
MAX: human-centric search of the physical world
MAX is a system that facilitates human-centric search of the physical world. It allows humans to search for and locate objects as and when they need it instead of organizing them ...
Kok-Kiong Yap, Vikram Srinivasan, Mehul Motani
GIS
2009
ACM
15 years 6 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...