Sciweavers

146 search results - page 19 / 30
» A Comparison of Bloat Control Methods for Genetic Programmin...
Sort
View
EPS
1998
Springer
13 years 12 months ago
Evolving Heuristics for Planning
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 2 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
DAC
2000
ACM
14 years 8 months ago
Practical iterated fill synthesis for CMP uniformity
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
14 years 8 days ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom