Sciweavers

52 search results - page 9 / 11
» Apply ant colony optimization to Tetris
Sort
View
LSSC
2007
Springer
14 years 3 months ago
An Ant-Based Model for Multiple Sequence Alignment
Abstract. Multiple sequence alignment is a key process in today’s biology, and finding a relevant alignment of several sequences is much more challenging than just optimizing so...
Frédéric Guinand, Yoann Pigné
COR
2007
80views more  COR 2007»
13 years 9 months ago
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
Rapeepan Pitakaso, Christian Almeder, Karl F. Doer...
LSSC
2005
Springer
14 years 3 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 4 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
JGO
2010
121views more  JGO 2010»
13 years 8 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts