Sciweavers

Share
ANTSW
2006
Springer
8 years 10 months ago
ACO Applied to Switch Engine Scheduling in a Railroad Yard
Jodelson A. Sabino, Thomas Stützle, Mauro Bir...
ANTSW
2006
Springer
9 years 3 days ago
Covering a Continuous Domain by Distributed, Limited Robots
We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in t...
Eliyahu Osherovich, Alfred M. Bruckstein, Vladimir...
ANTSW
2006
Springer
9 years 3 days ago
Higher Order Pheromone Models in Ant Colony Optimisation
Ant colony optimisation is a constructive metaheuristic that successively builds solutions from problem-specific components. A parameterised model known as pheromone--an analogue o...
James Montgomery
ANTSW
2006
Springer
9 years 3 days ago
Replicating Multi-quality Web Applications Using ACO and Bipartite Graphs
Christopher B. Mayer, Judson Dressler, Felicia Har...
ANTSW
2006
Springer
9 years 3 days ago
An Estimation of Distribution Particle Swarm Optimization Algorithm
Abstract. In this paper we present an estimation of distribution particle swarm optimization algorithm that borrows ideas from recent developments in ant colony optimization. In th...
Mudassar Iqbal, Marco Antonio Montes de Oca
ANTSW
2006
Springer
9 years 3 days ago
Autonomous Gossiping of Information in a P2P Network with Artificial Ants
Abstract. They appeared in our life some years ago with the awakening of the PC and now the are everywhere : computers have become ubiquitous and, almost, irreplaceable. Classical ...
Christophe Guéret, Nicolas Monmarché...
ANTSW
2006
Springer
9 years 3 days ago
An Enhanced Aggregation Pheromone System for Real-Parameter Optimization in the ACO Metaphor
Abstract. In previous papers we proposed an algorithm for real parameter optimization called the Aggregation Pheromone System (APS). The APS replaces pheromone trails in traditiona...
Shigeyoshi Tsutsui
ANTSW
2006
Springer
9 years 3 days 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
books