3422 search results - page 92 / 685 » Random Subset Optimization |
124
click to vote
ISPD
2000
ACM
15 years 6 months ago
2000
ACM
We propose a gate resizing method for delay and power optimization that is based on statistical static timing analysis. Our method focuses on the component of timing uncertainties...
143
Voted
JMLR
2012
13 years 5 months ago
2012
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
119
Voted
ICIAP
2005
ACM
16 years 2 months ago
2005
ACM
Abstract. This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is base...
125
Voted
MOC
2000
15 years 2 months ago
2000
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
112
click to vote
JACM
2010
15 years 29 days ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...