Sciweavers

944 search results - page 50 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
PVLDB
2008
174views more  PVLDB 2008»
14 years 11 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
AAAI
2007
15 years 2 months ago
Search Space Reduction and Russian Doll Search
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
Kenil C. K. Cheng, Roland H. C. Yap
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 7 days ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
ICRA
2002
IEEE
161views Robotics» more  ICRA 2002»
15 years 4 months ago
Mosaicing Large Cyclic Environments for Visual Navigation in Autonomous Vehicles
Mobile robot localization from large-scale appearance mosaics has been showing increasing promise as a low-cost, high-performance and infrastructure-free solution to vehicle guida...
Ranjith Unnikrishnan, Alonzo Kelly
EWCBR
2008
Springer
15 years 1 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...