Sciweavers

361 search results - page 60 / 73
» Ant Colony Optimization
Sort
View
ANTSW
2006
Springer
14 years 1 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
IJWMC
2006
85views more  IJWMC 2006»
13 years 10 months ago
A distributed clustering method for energy-efficient data gathering in sensor networks
: Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable in prolonging the lifetime of a sensor network as long as possibl...
Junpei Kamimura, Naoki Wakamiya, Masayuki Murata
ANTS
1994
Springer
83views Algorithms» more  ANTS 1994»
14 years 2 months ago
On orders of optimal normal basis generators
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
Shuhong Gao, Scott A. Vanstone
ATAL
2007
Springer
14 years 4 months ago
Convergence and rate of convergence of a simple ant model
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
Amine M. Boumaza, Bruno Scherrer
AUTONOMICS
2008
ACM
13 years 12 months ago
QoS-aware ant routing with colored pheromones in wireless mesh networks
Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Network...
Martina Umlauft, Wilfried Elmenreich