Sciweavers

52 search results - page 8 / 11
» Apply ant colony optimization to Tetris
Sort
View
NABIC
2010
13 years 4 months ago
Regional ACO-based routing for load-balancing in NoC systems
Abstract--Ant Colony Optimization (ACO) is a problemsolving technique that was inspired by the related research on the behavior of real-world ant colony. In the domain of Network-o...
Hsien-Kai Hsin, En-Jui Chang, Chih-Hao Chao, An-Ye...
EVOW
2000
Springer
14 years 1 months ago
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
Daniel Merkle, Martin Middendorf
ITCC
2005
IEEE
14 years 3 months ago
Simulation of Mobility and Routing in Ad Hoc Networks using Ant Colony Algorithms
Mobile Ad-hoc Networks (MANET’s) have recently attracted a lot of attention in the research community as well as the industry. This technology has become increasingly important ...
Tarek H. Ahmed
CEC
2007
IEEE
14 years 4 months ago
The differential ant-stigmergy algorithm: an experimental evaluation and a real-world application
— This paper describes the so-called Differential Ant-Stigmergy Algorithm (DASA), which is an extension of the Ant-Colony Optimization for a continuous domain. An experimental ev...
Peter Korosec, Jurij Silc, Klemen Oblak, Franc Kos...
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 10 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache