Sciweavers

23 search results - page 4 / 5
» Ant Colony Programming for Approximation Problems
Sort
View
ANTSW
2006
Springer
13 years 9 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
GECCO
2003
Springer
13 years 10 months 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
GECCO
2009
Springer
169views Optimization» more  GECCO 2009»
13 years 10 months ago
An ant based algorithm for task allocation in large-scale and dynamic multiagent scenarios
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating i...
Fernando dos Santos, Ana L. C. Bazzan
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
13 years 9 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
GLOBECOM
2010
IEEE
13 years 3 months ago
Graph-Based Optimization for Relay-Assisted Bidirectional Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
Yuan Liu, Meixia Tao