3446 search results - page 161 / 690 » A Reasoning Algorithm for pD* |
124
click to vote
FLAIRS
2006
15 years 5 months ago
2006
We present a hill-climbing algorithm to solve planning problems with temporal uncertainty. First an optimistic plan that is valid when all actions complete quickly is found. Then ...
DLOG
1996
15 years 5 months ago
1996
Designing a DL system poses the problem of the trade-o between power of expression and complexity. In spite of their rich expressive capacity, the or and not constructors are usua...
130
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
121
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
218
click to vote
GIS
2006
ACM
16 years 5 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...