Sciweavers

269 search results - page 37 / 54
» A branch and bound method for stochastic global optimization
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 10 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
AI
2010
Springer
14 years 9 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...
BMCBI
2006
137views more  BMCBI 2006»
14 years 9 months ago
Bounded search for de novo identification of degenerate cis-regulatory elements
Background: The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential ...
Jonathan M. Carlson, Arijit Chakravarty, Radhika S...
AB
2007
Springer
15 years 1 months ago
Efficient Haplotype Inference with Pseudo-boolean Optimization
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
Ana Graça, João Marques-Silva, In&ec...
MICCAI
2004
Springer
15 years 10 months ago
Shape Particle Filtering for Image Segmentation
Abstract. Deformable template models are valuable tools in medical image segmentation. Current methods elegantly incorporate global shape and appearance, but can not cope with loca...
Marleen de Bruijne, Mads Nielsen