173 search results - page 30 / 35 » Search Complexities for HTN Planning |
CP
2007
Springer
14 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
W2GIS
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
CHI
2003
ACM
14 years 7 months ago
2003
ACM
Calendar applications for small handheld devices such as PDAs are growing in popularity. This led us to develop FishCal, a novel calendar interface for PDAs. It supports users in ...
ICAC
2009
IEEE
14 years 2 months ago
2009
IEEE
Increasingly, applications need to be able to self-reconfigure in response to changing requirements and environmental conditions. Autonomic computing has been proposed as a means...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...