Sciweavers

605 search results - page 46 / 121
» Probabilistic state space search
Sort
View
AAAI
2004
13 years 10 months ago
Structured Duplicate Detection in External-Memory Graph Search
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
Rong Zhou, Eric A. Hansen
IJCAI
2001
13 years 10 months ago
Local Search Topology in Planning Benchmarks: An Empirical Analysis
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
Jörg Hoffmann
IBERAMIA
2004
Springer
14 years 2 months ago
Constrainedness and Redundancy by Constraint Ordering
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Miguel A. Salido, Federico Barber
DEXAW
2009
IEEE
125views Database» more  DEXAW 2009»
14 years 3 months ago
Comparison Between Manually and Automatically Assigned Descriptors Based on a German Bibliographic Collection
—This paper compares and illustrates the use of manually and automatically assigned descriptors on German documents extracted from the GIRT Corpus. A second objective is to analy...
Claire Fautsch, Jacques Savoy
ICRA
2009
IEEE
176views Robotics» more  ICRA 2009»
14 years 3 months ago
Path planning in 1000+ dimensions using a task-space Voronoi bias
— The reduction of the kinematics and/or dynamics of a high-DOF robotic manipulator to a low-dimension “task space” has proven to be an invaluable tool for designing feedback...
Alexander C. Shkolnik, Russ Tedrake