Sciweavers

51 search results - page 3 / 11
» Search for Dynamic Equilibrium in Duel Problems by Global Op...
Sort
View
IPPS
2007
IEEE
13 years 12 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 9 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
TEC
2010
171views more  TEC 2010»
13 years 8 days ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
13 years 11 months ago
Coordinating multi-rover systems: evaluation functions for dynamic and noisy environments
This paper addresses the evolution of control strategies for a collective: a set of entities that collectively strives to maximize a global evaluation function that rates the perf...
Kagan Tumer, Adrian K. Agogino
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 6 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