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
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-...
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 ...
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...
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 ...