Sciweavers

1155 search results - page 71 / 231
» Continuous dynamic problem generators for evolutionary algor...
Sort
View
LATIN
1998
Springer
15 years 4 months ago
Dynamic Packet Routing on Arrays with Bounded Buffers
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
101
Voted
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
15 years 6 months ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener
CF
2008
ACM
15 years 2 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
117
Voted
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 1 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
112
Voted
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 4 months ago
Improving evolutionary real-time testing
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...
Marouane Tlili, Stefan Wappler, Harmen Sthamer