Sciweavers

968 search results - page 56 / 194
» A faster implementation of APlace
Sort
View
ICRA
1998
IEEE
110views Robotics» more  ICRA 1998»
15 years 8 months ago
A Framework for Efficient Minimum Distance Computations
In this paper we present a framework for minimum distance computations that allows efficient solution of minimum distance queries on a variety of surface representations, includin...
David E. Johnson, Elaine Cohen
PLILP
1994
Springer
15 years 8 months ago
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
Philippe Codognet, Daniel Diaz
SIGGRAPH
1994
ACM
15 years 8 months ago
Fast contact force computation for nonpenetrating rigid bodies
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
David Baraff
ITP
2010
163views Mathematics» more  ITP 2010»
15 years 8 months ago
Fast LCF-Style Proof Reconstruction for Z3
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
Sascha Böhme, Tjark Weber
ACL
2007
15 years 5 months ago
Substring-Based Transliteration
Transliteration is the task of converting a word from one alphabetic script to another. We present a novel, substring-based approach to transliteration, inspired by phrasebased mo...
Tarek Sherif, Grzegorz Kondrak