2799 search results - page 282 / 560 » Comparing Point Clouds |
191
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
180
click to vote
SAS
1997
Springer
15 years 10 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
159
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
153
click to vote
MPC
1992
Springer
15 years 10 months ago
1992
Springer
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are...
149
click to vote
PARLE
1992
15 years 10 months ago
1992
We compare di erent degrees of architecture abstraction and communication reliability in distributed programming languages. A nearly architecture independent logic programming lang...