Sciweavers

2914 search results - page 549 / 583
» Optimization by Stochastic Continuation
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 10 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 10 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
CVPR
2007
IEEE
13 years 9 months ago
PrivacyCam: a Privacy Preserving Camera Using uCLinux on the Blackfin DSP
Considerable research work has been done in the area of surveillance and biometrics, where the goals have always been high performance, robustness in security and cost optimizatio...
Ankur Chattopadhyay, Terrance E. Boult
BMCBI
2007
143views more  BMCBI 2007»
13 years 9 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
COR
2006
97views more  COR 2006»
13 years 9 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets