Sciweavers

1972 search results - page 137 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 9 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
IJON
2006
127views more  IJON 2006»
13 years 9 months ago
Evolved neural networks based on cellular automata for sensory-motor controller
Constructing the controller of a mobile robot has several issues to be addressed: how to automate behavior generation procedure, how to insert available domain knowledge effective...
Kyung-Joong Kim, Sung-Bae Cho
CVPR
2003
IEEE
14 years 2 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
CP
2009
Springer
14 years 10 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
BMCBI
2010
185views more  BMCBI 2010»
13 years 9 months ago
ABCtoolbox: a versatile toolkit for approximate Bayesian computations
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
Daniel Wegmann, Christoph Leuenberger, Samuel Neue...