99 search results - page 6 / 20 » Complexity of Langton's ant |
ANTS
1998
Springer
13 years 11 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
ACMDIS
2010
ACM
13 years 7 months ago
2010
ACM
Emergence is a concept that is not easy to grasp, since it contradicts our idea of central control and planning. In this work, we use a swarm of robots as a tangible tool to visua...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
WEBNET
2000
13 years 8 months ago
2000
In this paper, we present our lessons from the design and use of two educational software tools for teaching behavioral modeling to graduate students of digital art. The tools, Pai...
ANTS
2004
Springer
14 years 23 days ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...