3333 search results - page 155 / 667 » Abstract Proof Search |
141
click to vote
AIPS
2011
14 years 7 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
124
click to vote
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
Abstract. Peer-to-peer architectures are a potentially powerful model for developing large-scale networks of text-based digital libraries, but peer-to-peer networks have so far pro...
153
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
125
click to vote
PUK
2000
15 years 5 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
160
click to vote
AUSAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...