Sciweavers

602 search results - page 65 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
CPHYSICS
2006
119views more  CPHYSICS 2006»
14 years 9 months ago
GDF: A tool for function estimation through grammatical evolution
This article introduces a tool for data fitting that is based on genetic programming and especially on the grammatical evolution technique. The user needs to input a series of poi...
Ioannis G. Tsoulos, Dimitris Gavrilis, Evangelos D...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
103
Voted
UAI
2004
14 years 11 months ago
Recovering Articulated Object Models from 3D Range Data
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...
Dragomir Anguelov, Daphne Koller, Hoi-Cheung Pang,...
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
15 years 3 months ago
Unbiased tournament selection
Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection...
Artem Sokolov, Darrell Whitley
86
Voted
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 1 months ago
Single and multi-objective genetic operators in object-oriented conceptual software design
This poster paper investigates the potential of single and multiobjective genetic operators with an object-oriented conceptual design space. Using cohesion as an objective fitness...
Christopher L. Simons, Ian C. Parmee