Sciweavers

2407 search results - page 272 / 482
» The evolutionary forest algorithm
Sort
View
IPL
2006
115views more  IPL 2006»
15 years 6 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
158
Voted
CEC
2008
IEEE
16 years 28 days ago
Potential and dynamics-based Particle Swarm Optimization
Abstract— The Particle Swarm Optimization (PSO) algorithm is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper p...
Hyungmin Park, Jong-Hwan Kim
CEC
2005
IEEE
16 years 2 days ago
Effects of experience bias when seeding with prior results
Abstract- Seeding the population of an evolutionary algorithm with solutions from previous runs has proved to be useful when learning control strategies for agents operating in a c...
Mitchell A. Potter, R. Paul Wiegand, H. Joseph Blu...
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 11 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
ATAL
2006
Springer
15 years 10 months ago
A novel method for automatic strategy acquisition in N-player non-zero-sum games
We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. ...
Steve Phelps, Marek Marcinkiewicz, Simon Parsons