1484 search results - page 45 / 297 » Ants meeting algorithms |
ANTS
2010
Springer
14 years 2 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
CEC
2007
IEEE
14 years 4 months ago
2007
IEEE
— We present an ant-based algorithm for spatially sorting objects into an annular structure. The model is minimal, as it requires only stochastic ant behaviour coupled with a phe...
AUSAI
2004
Springer
14 years 3 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
ANTS
2010
Springer
14 years 2 months ago
2010
Springer
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...