Sciweavers

1871 search results - page 19 / 375
» Selecting for evolvable representations
Sort
View
CCE
2006
13 years 8 months ago
New approaches for representing, analyzing and visualizing complex kinetic transformations
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
Ioannis P. Androulakis
HIS
2008
13 years 10 months ago
New Crossover Operator for Evolutionary Rule Discovery in XCS
XCS is a learning classifier system that combines a reinforcement learning scheme with evolutionary algorithms to evolve rule sets on-line by means of the interaction with an envi...
Sergio Morales-Ortigosa, Albert Orriols-Puig, Este...
PAMI
2006
134views more  PAMI 2006»
13 years 8 months ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
14 years 3 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper
EVOW
2005
Springer
14 years 2 months ago
Evolving Reversible Circuits for the Even-Parity Problem
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in ord...
Mihai Oltean