Sciweavers

316 search results - page 13 / 64
» Reducing the Cost of Generating APH-Distributed Random Numbe...
Sort
View
ICFP
2002
ACM
14 years 8 months ago
An experimental study of renewal-older-first garbage collection
Generational collection has improved the efficiency of garbage collection in fast-allocating programs by focusing on collecting young garbage, but has done little to reduce the co...
Lars Thomas Hansen, William D. Clinger
JMLR
2012
11 years 11 months ago
Adaptive MCMC with Bayesian Optimization
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
Nimalan Mahendran, Ziyu Wang, Firas Hamze, Nando d...
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
14 years 3 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
ICIP
2007
IEEE
14 years 10 months ago
Automatic Parametrisation for an Image Completion Method Based on Markov Random Fields
Recently, a new exemplar-based method for image completion, texture synthesis and image inpainting was proposed which uses a discrete global optimization strategy based on Markov ...
Huy Tho Ho, Roland Göcke
IEEEPACT
2007
IEEE
14 years 3 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson