Sciweavers

224 search results - page 36 / 45
» Quick-and-dirty ant colony optimization
Sort
View
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
13 years 11 months ago
Finding safety errors with ACO
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
Enrique Alba, J. Francisco Chicano
LION
2009
Springer
210views Optimization» more  LION 2009»
14 years 2 months ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
Manuel López-Ibáñez, Christia...
JGO
2010
121views more  JGO 2010»
13 years 6 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
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
14 years 1 months ago
ACO vs EAs for solving a real-world frequency assignment problem in GSM networks
Frequency planning is a very important task for current GSM operators. In this work we present a new mathematical formulation of the problem in which the frequency plans are evalu...
Francisco Luna, Christian Blum, Enrique Alba, Anto...
GECCO
2003
Springer
14 years 24 days ago
The State Problem for Evolutionary Testing
Abstract. This paper shows how the presence of states in test objects can hinder or render impossible the search for test data using evolutionary testing. Additional guidance is re...
Phil McMinn, Mike Holcombe