Sciweavers

942 search results - page 117 / 189
» Distance Constraint Satisfaction Problems
Sort
View
116
Voted
STDBM
2004
Springer
171views Database» more  STDBM 2004»
15 years 3 months ago
Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
Yoshiharu Ishikawa, Yuichi Tsukamoto, Hiroyuki Kit...
108
Voted
AAAI
2007
15 years 17 days ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
86
Voted
AI
1999
Springer
14 years 10 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
100
Voted
CP
2011
Springer
13 years 10 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
79
Voted
ICML
1996
IEEE
15 years 11 months ago
Passive Distance Learning for Robot Navigation
Autonomous mobile robots need good models of their environment, sensors and actuators to navigate reliably and efficiently. While this information can be supplied by humans, or le...
Sven Koenig, Reid G. Simmons