Sciweavers

128 search results - page 11 / 26
» ants 2006
Sort
View
COMBINATORICS
2006
101views more  COMBINATORICS 2006»
14 years 10 months ago
Optimal Penney Ante Strategy via Correlation Polynomial Identities
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
Daniel Felix
ASAP
2006
IEEE
142views Hardware» more  ASAP 2006»
14 years 11 months ago
NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm
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...
Masoud Daneshtalab, Ashkan Sobhani, Ali Afzali-Kus...
NETWORK
2006
302views more  NETWORK 2006»
14 years 9 months ago
Node clustering in wireless sensor networks: recent developments and deployment challenges
The large-scale deployment of wireless sensor networks (WSNs) and the need for data aggregation necessitate efficient organization of the network topology for the purpose of balan...
Ossama Younis, Marwan Krunz, Srinivasan Ramasubram...
ISDA
2006
IEEE
15 years 3 months ago
Finding Groups in Data: Cluster Analysis with Ants
We present in this paper a modification of Lumer and Faieta’s algorithm for data clustering. This algorithm discovers automatically clusters in numerical data without prior kno...
Urszula Boryczka
ESCIENCE
2006
IEEE
15 years 3 months ago
Niching for Population-Based Ant Colony Optimization
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
Daniel Angus