Sciweavers

71 search results - page 6 / 15
» Simple Monte Carlo and the Metropolis algorithm
Sort
View
ACG
2009
Springer
15 years 1 months ago
A Study of UCT and Its Enhancements in an Artificial Game
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
David Tom, Martin Müller
CSDA
2011
14 years 4 months ago
Mapping electron density in the ionosphere: A principal component MCMC algorithm
The outer layers of the Earth’s atmosphere are known as the ionosphere, a plasma of free electrons and positively charged atomic ions. The electron density of the ionosphere var...
Eman Khorsheed, Merrilee Hurn, Christopher Jenniso...
WWW
2006
ACM
15 years 10 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
IJPP
2011
99views more  IJPP 2011»
14 years 4 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
WSC
2004
14 years 10 months ago
Simulation-Based Optimization Using Simulated Annealing With Confidence Interval
This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be eva...
Talal M. Alkhamis, Mohamed A. Ahmed