3758 search results - page 227 / 752 » A Complete Subsumption Algorithm |
102
click to vote
CORR
1998
Springer
15 years 2 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
116
click to vote
IJRR
2002
15 years 2 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
113
click to vote
COCO
2004
Springer
15 years 7 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
119
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
113
click to vote
FQAS
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Many heterogeneous database system products and prototypes exist today; they will soon be deployed in a wide variety of environments. Most existing systems suffer from an...