Sciweavers

2096 search results - page 367 / 420
» Evolutionary multiobjective optimization
Sort
View
GECCO
2003
Springer
15 years 6 months ago
Dynamic Maximum Tree Depth
We present a technique, designated as dynamic maximum tree depth, for avoiding excessive growth of tree-based GP individuals during the evolutionary process. This technique introdu...
Sara Silva, Jonas Almeida
GECCO
2003
Springer
167views Optimization» more  GECCO 2003»
15 years 6 months ago
Dimensionality Reduction via Genetic Value Clustering
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
Alexander P. Topchy, William F. Punch
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
15 years 6 months ago
Spatial Operators for Evolving Dynamic Bayesian Networks from Spatio-temporal Data
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
Allan Tucker, Xiaohui Liu, David Garway-Heath
PG
2002
IEEE
15 years 6 months ago
Lworld: An Animation System Based on Rewriting
Lworld is a computer graphics animation system based on L-systems, a parallel rewriting technique used primarily in computer graphics for plant modeling. Because rulebased program...
Hansrudi Noser
EMMCVPR
2001
Springer
15 years 6 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo