Sciweavers

436 search results - page 18 / 88
» Ant algorithms and stigmergy
Sort
View
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
16 years 3 days ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
ATAL
2010
Springer
15 years 7 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
15 years 3 months ago
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...
João Pedro, João Pires, João ...
ICIP
2006
IEEE
16 years 7 months ago
Texture Classification with Ants
In this paper, we present a novel texture classification algorithm inspired by the self-assembling behavior of real ants when building live structures with their bodies. The propo...
Arshad Hussain, Nasir Rajpoot, Kashif Rajpoot
ANTS
2004
Springer
97views Algorithms» more  ANTS 2004»
15 years 11 months ago
Elliptic Curves with a Given Number of Points
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
Reinier Bröker, Peter Stevenhagen