Sciweavers

602 search results - page 14 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
SSPR
2004
Springer
14 years 4 months ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli
ICIC
2009
Springer
14 years 5 months ago
Function Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
Shixian Wang, Yuehui Chen, Peng Wu
AMC
2005
195views more  AMC 2005»
13 years 10 months ago
A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equations
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
Onur Kiymaz, Seref Mirasyedioglu
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
14 years 5 months ago
Evolving controllers for simulated car racing using object oriented genetic programming
Several different controller representations are compared on a non-trivial problem in simulated car racing, with respect to learning speed and final fitness. The controller rep...
Alexandros Agapitos, Julian Togelius, Simon M. Luc...
ICGA
1993
145views Optimization» more  ICGA 1993»
14 years 6 days ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein