Sciweavers

314 search results - page 5 / 63
» Optimizing efficiency of perturbative Monte Carlo method
Sort
View
WSC
1998
15 years 3 months ago
Average Performance of Quasi Monte Carlo Methods for Global Optimization
In this paper we compare the average performance of one class of low-discrepancy quasi-Monte Carlo sequences for global optimization. Weiner measure is assumed as the probability ...
Hisham A. Al-Mharmah
CVPR
2009
IEEE
16 years 3 days ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...
JCC
2006
69views more  JCC 2006»
15 years 1 months ago
Dramatic performance enhancements for the FASTER optimization algorithm
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
Benjamin D. Allen, Stephen L. Mayo
CAD
2006
Springer
15 years 1 months ago
A quasi-Monte Carlo method for computing areas of point-sampled surfaces
A novel and efficient quasi-Monte Carlo method for computing the area of a point-sampled surface with associated surface normal for each point is presented. Our method operates di...
Yu-Shen Liu, Jun-Hai Yong, Hui Zhang, Dong-Ming Ya...