Sciweavers

727 search results - page 49 / 146
» Private approximation of search problems
Sort
View
AMAI
2004
Springer
14 years 3 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
EOR
2006
57views more  EOR 2006»
13 years 10 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
ICRA
2009
IEEE
134views Robotics» more  ICRA 2009»
14 years 4 months ago
Combining search and action for mobile robots
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
Geoffrey Hollinger, Dave Ferguson, Siddhartha Srin...
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
12 years 14 days ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
14 years 2 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani