Sciweavers

345 search results - page 54 / 69
» Ant Colony Optimization for Multi-Objective Optimization Pro...
Sort
View
GECCO
2004
Springer
14 years 27 days ago
Finding Maximum Cliques with Distributed Ants
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
Thang Nguyen Bui, Joseph R. Rizzo
ADHOC
2008
183views more  ADHOC 2008»
13 years 7 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
ANTSW
2006
Springer
13 years 11 months ago
An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks
Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand...
Tiago Camilo, Carlos Carreto, Jorge Sá Silv...
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
13 years 11 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
EVOW
2004
Springer
13 years 11 months ago
Multi-objective Sensor Planning for Efficient and Accurate Object Reconstruction
A novel approach for sensor planning, which incorporates multi-objective optimization principals into the autonomous design of sensing strategies, is presented. The study addresses...
Enrique Dunn, Gustavo Olague