Sciweavers

22 search results - page 4 / 5
» Loopy Substructural Local Search for the Bayesian Optimizati...
Sort
View
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
13 years 11 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
BMCBI
2007
190views more  BMCBI 2007»
13 years 6 months ago
Discriminative motif discovery in DNA and protein sequences using the DEME algorithm
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
Emma Redhead, Timothy L. Bailey
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
13 years 11 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
AI
2010
Springer
13 years 6 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
ICPR
2008
IEEE
14 years 20 days ago
Layered shape matching and registration: Stochastic sampling with hierarchical graph representation
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
Xiaobai Liu, Liang Lin, Hongwei Li, Hai Jin, Wenbi...