Sciweavers

2407 search results - page 314 / 482
» The evolutionary forest algorithm
Sort
View
147
Voted
GECCO
2004
Springer
15 years 11 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
15 years 11 months ago
A New Approach to Improve Particle Swarm Optimization
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
Liping Zhang, Huanjun Yu, Shangxu Hu
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 9 months ago
Enhancing the GA's Ability to Cope with Dynamic Environments
: The Shifting Balance Genetic Algorithm (SBGA) is a pluggable module for a GA (or any other Evolutionary Algorithm) based on a modification of Sewall Wright's shifting balanc...
Mark Wineberg, Franz Oppacher
CEC
2005
IEEE
15 years 8 months ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin
CP
2005
Springer
15 years 8 months ago
Evolving Variable-Ordering Heuristics for Constrained Optimisation
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
Stuart Bain, John Thornton, Abdul Sattar