2214 search results - page 201 / 443 » Complexity of Reasoning |
183
Voted
EWCBR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
151
Voted
EWCBR
2008
Springer
15 years 5 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
145
Voted
CADE
2010
Springer
15 years 4 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
149
click to vote
CSL
2010
Springer
15 years 4 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
114
Voted
GIS
2008
ACM
15 years 4 months ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...