466 search results - page 51 / 94 » Monte Carlo methods for matrix computations on the grid |
106
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
MP
2006
14 years 9 months ago
2006
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
SAC
2010
ACM
14 years 4 months ago
2010
ACM
The label switching problem is caused by the likelihood of a Bayesian mixture model being invariant to permutations of the labels. The permutation can change multiple times betwee...
ICGA
2007
14 years 9 months ago
2007
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
100
click to vote
DAC
2010
ACM
14 years 10 months ago
2010
ACM
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...