1887 search results - page 6 / 378 » An efficient search algorithm for partially ordered sets |
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
IJCAI
2001
13 years 9 months ago
2001
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
AAAI
1993
13 years 9 months ago
1993
This paper provides a systematic analysisof the relativeutility of basingEBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate th...
AIPS
2007
13 years 10 months ago
2007
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...