Sciweavers

436 search results - page 47 / 88
» Ant algorithms and stigmergy
Sort
View
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
15 years 8 months ago
Abelian Varieties with Prescribed Embedding Degree
We present an algorithm that, on input of a CM-field K, an integer k 1, and a prime r 1 mod k, constructs a q-Weil number OK corresponding to an ordinary, simple abelian variety ...
David Freeman, Peter Stevenhagen, Marco Streng
ANTS
2008
Springer
103views Algorithms» more  ANTS 2008»
15 years 8 months ago
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
Koray Karabina, Edlyn Teske
EVOW
2009
Springer
16 years 27 days ago
Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
Xiaomin Hu, Jun Zhang, Li-Ming Zhang
COR
2007
80views more  COR 2007»
15 years 6 months ago
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
Rapeepan Pitakaso, Christian Almeder, Karl F. Doer...
FLAIRS
2006
15 years 7 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers