99 search results - page 7 / 20 » Complexity of Langton's ant |
ANTS
2004
Springer
14 years 23 days ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
ANTS
2008
Springer
13 years 9 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
ASP
2001
Springer
13 years 12 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
GRID
2004
Springer
14 years 23 days ago
2004
Springer
e-Science has much to benefit from the emerging field of grid computing. However, construction of e-Science grids is a complex and inefficient undertaking. In particular, deployme...