Sciweavers

1594 search results - page 142 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
FORTE
2004
15 years 4 months ago
Witness and Counterexample Automata for ACTL
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
Robert Meolic, Alessandro Fantechi, Stefania Gnesi
SIGGRAPH
1994
ACM
15 years 7 months ago
Planning motions with intentions
We apply manipulation planning to computer animation. A new path planner is presented that automatically computes the collision-free trajectories for several cooperating arms toma...
Yoshihito Koga, Koichi Kondo, James Kuffner, Jean-...
142
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
CORR
2008
Springer
227views Education» more  CORR 2008»
15 years 3 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan
SIAMJO
2002
89views more  SIAMJO 2002»
15 years 3 months ago
A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
Stephen C. Billups, Layne T. Watson