Sciweavers

65 search results - page 2 / 13
» Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Opti...
Sort
View
TCS
2010
13 years 3 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
CPAIOR
2008
Springer
13 years 6 months ago
Efficient Haplotype Inference with Combined CP and OR Techniques
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
Ana Graça, João Marques-Silva, In&ec...
CORR
2008
Springer
65views Education» more  CORR 2008»
13 years 5 months ago
A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...
Zvika Ben-Haim, Yonina C. Eldar
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
13 years 9 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 8 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant