1331 search results - page 159 / 267 » Complexity bounds for zero-test algorithms |
CP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
NIPS
2003
14 years 11 months ago
2003
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...
CVGIP
2010
14 years 10 months ago
2010
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
AAAI
2011
13 years 10 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...