Sciweavers

565 search results - page 22 / 113
» A Guided Monte Carlo Approach to Optimization Problems
Sort
View
TCBB
2010
137views more  TCBB 2010»
14 years 4 months ago
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...
István Miklós, Bence Melykuti, Krist...
ICML
2003
IEEE
15 years 3 months ago
Evolutionary MCMC Sampling and Optimization in Discrete Spaces
The links between genetic algorithms and population-based Markov Chain Monte Carlo (MCMC) methods are explored. Genetic algorithms (GAs) are well-known for their capability to opt...
Malcolm J. A. Strens
DAC
2010
ACM
14 years 10 months ago
QuickYield: an efficient global-search based parametric yield estimation with performance constraints
With technology scaling down to 90nm and below, many yield-driven design and optimization methodologies have been proposed to cope with the prominent process variation and to incr...
Fang Gong, Hao Yu, Yiyu Shi, Daesoo Kim, Junyan Re...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 4 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
CVPR
2003
IEEE
15 years 12 months ago
An Efficient Approach to Learning Inhomogeneous Gibbs Model
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...
Ziqiang Liu, Hong Chen, Heung-Yeung Shum