Sciweavers

421 search results - page 30 / 85
» Ant algorithms
Sort
View
ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
13 years 9 months ago
Computing Hilbert Class Polynomials
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 < ...
Juliana Belding, Reinier Bröker, Andreas Enge...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 1 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
CEC
2003
IEEE
13 years 11 months ago
A modified ant colony algorithm for evolutionary design of digital circuits
Evolutionary computation presents a new paradigm shift in hardware design and synthesis. According to this paradigm, hardware design is pursued by deriving inspiration from biologi...
Mostafa Abd-El-Barr, Sadiq M. Sait, Bambang A. B. ...
COMCOM
2007
82views more  COMCOM 2007»
13 years 7 months ago
Jumping ant routing algorithm for sensor networks
Enterprises that may rely on critical equipments which are constantly moving around, for example, hospitals – need to ensure they can know the current location of vital but mobi...
Wei-Ming Chen, Chung-Sheng Li, Fu-Yu Chiang, Han-C...
WONS
2005
IEEE
14 years 1 months ago
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...