20 search results - page 3 / 4 » Backtracking iterators |
3DIM
2003
IEEE
13 years 9 months ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
3DIM
2007
IEEE
14 years 3 days ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
OOPSLA
2009
Springer
14 years 9 days ago
2009
Springer
Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordinat...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...