436 search results - page 28 / 88 » Ant algorithms and stigmergy |
136
click to vote
ANTS
1998
Springer
15 years 10 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
187
click to vote
ANTS
2006
Springer
15 years 9 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
151
click to vote
ASAP
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, a routing model for minimizing hot spots in the network on chip (NOC) is presented. The model makes use of AntNet routing algorithm which is based on Ant colony. Us...
160
click to vote
CIDM
2009
IEEE
15 years 10 months ago
2009
IEEE
Most real-world classification problems involve continuous (real-valued) attributes, as well as, nominal (discrete) attributes. The majority of Ant Colony Optimisation (ACO) classi...
168
click to vote
ANTSW
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...