1713 search results - page 51 / 343 » Planning for Performance |
COMPGEOM
1999
ACM
15 years 2 months ago
1999
ACM
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
FLAIRS
2007
15 years 2 days ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
100
click to vote
WWW
2005
ACM
15 years 10 months ago
2005
ACM
A staggering number of multimedia applications are being introduced every day. Yet, the inordinate delays encountered in retrieving multimedia documents make it difficult to use t...
AAAI
1994
14 years 11 months ago
1994
This paper presents snlp+ebl, the first implementation of explanation based learning techniques for a partial order planner. We describe the basic learning framework of snlp+ebl, ...