Sciweavers

850 search results - page 103 / 170
» On Genetic Algorithms and Lindenmayer Systems
Sort
View
JSC
2006
102views more  JSC 2006»
15 years 6 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards
EC
2000
123views ECommerce» more  EC 2000»
15 years 6 months ago
Embodiment of Evolutionary Computation in General Agents
Holland's Adaptation in Natural and Artificial Systems largely dealt with how systems, comprised of many self-interested entities, can and should adapt as a whole. This semin...
Robert E. Smith, Claudio Bonacina, Paul E. Kearney...
PLDI
2004
ACM
15 years 11 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
ICPR
2008
IEEE
16 years 23 days ago
Discriminative HMM training with GA for handwritten word recognition
This paper presents a recognition system for isolated handwritten Bangla words, with a fixed lexicon, using a left-right Hidden Markov Model (HMM). A stochastic search method, nam...
Tapan Kumar Bhowmik, Swapan K. Parui, Utpal Roy
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
15 years 11 months ago
A Method for Handling Numerical Attributes in GA-Based Inductive Concept Learners
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
Federico Divina, Maarten Keijzer, Elena Marchiori