Sciweavers

3038 search results - page 420 / 608
» Industrial evolutionary computing
Sort
View
EELC
2006
128views Languages» more  EELC 2006»
15 years 10 months ago
Evolving Distributed Representations for Language with Self-Organizing Maps
We present a neural-competitive learning model of language evolution in which several symbol sequences compete to signify a given propositional meaning. Both symbol sequences and p...
Simon D. Levy, Simon Kirby
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 10 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
15 years 10 months ago
Pareto-coevolutionary genetic programming classifier
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
Michal Lemczyk, Malcolm I. Heywood
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 10 months ago
Particle swarm with speciation and adaptation in a dynamic environment
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
Xiaodong Li, Jürgen Branke, Tim Blackwell
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 10 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom