Sciweavers

6943 search results - page 150 / 1389
» Representations for evolutionary algorithms
Sort
View
CEC
2010
IEEE
14 years 11 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
ACL
2006
14 years 11 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
Alexander Koller, Stefan Thater
EVOW
2001
Springer
15 years 2 months ago
An Evolutionary Annealing Approach to Graph Coloring
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
ICEC
1996
81views more  ICEC 1996»
14 years 11 months ago
A Self-Adaptive Approach to Representation Shifts in Cultural Algorithms
Abstract - The paper describes how a formal model of selfadaptation [Angeline, 1995] can be expressed in terms of Cultural Algorithms. A particular form of self-adaptation concerns...
Robert G. Reynolds, Chan-Jin Chung
ISPD
2000
ACM
92views Hardware» more  ISPD 2000»
15 years 2 months ago
An enhanced perturbing algorithm for floorplan design using the O-tree representation
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity,...
Yingxin Pang, Chung-Kuan Cheng, Takeshi Yoshimura