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...
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...
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...
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...
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,...