Sciweavers

2543 search results - page 350 / 509
» Optimal Ordered Problem Solver
Sort
View
EMMCVPR
2001
Springer
15 years 5 months ago
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
Manuele Bicego, Agostino Dovier, Vittorio Murino
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 4 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
89
Voted
GECCO
2007
Springer
147views Optimization» more  GECCO 2007»
15 years 4 months ago
A comparison of evaluation methods in coevolution
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that an evaluation against...
Ting-Shuo Yo, Edwin D. de Jong
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 4 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 4 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster