Sciweavers

137 search results - page 3 / 28
» Coarse-Graining in Genetic Algorithms: Some Issues and Examp...
Sort
View
VLSID
1996
IEEE
133views VLSI» more  VLSID 1996»
15 years 1 months ago
Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach
A technique for allocatzon and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach has been developed. The proposed genetic algorithm uses a non-conventi...
Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy G...
SAC
2008
ACM
14 years 9 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
14 years 11 months ago
Varying portfolio construction of stocks using genetic network programming with control nodes
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
Etsushi Ohkawa, Yan Chen, Shingo Mabu, Kaoru Shima...
EC
2002
228views ECommerce» more  EC 2002»
14 years 9 months ago
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Gen
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we pre...
Rajeev Kumar, Peter Rockett
GECCO
2004
Springer
15 years 3 months ago
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...
Gerulf K. M. Pedersen, David E. Goldberg