1331 search results - page 206 / 267 » Complexity bounds for zero-test algorithms |
ASIASIM
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents an efficient self-collision detection algorithm for deformable body simulation using programmable graphics processing units (GPUs). The proposed approach store...
COLT
2003
Springer
15 years 3 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
100
click to vote
CAV
2001
Springer
15 years 1 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
GRAPHICSINTERFACE
2007
14 years 11 months ago
2007
We present an interactive algorithm to compute surface distance maps for triangulated models. The distance map represents the distance-to-closest-primitive mapping at each point o...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...