Sciweavers

CEC
2007
IEEE
13 years 11 months ago
Experiments with Monte Carlo Othello
— In this paper, we report on our experiments with using Monte Carlo simulation (specifically the UCT algorithm) as the basis for an Othello playing program. Monte Carlo methods ...
Philip Hingston, Martin Masek
ICCAD
2007
IEEE
86views Hardware» more  ICCAD 2007»
14 years 1 months ago
Stimulus generation for constrained random simulation
Constrained random simulation is the main workhorse in today’s hardware verification flows. It requires the random generation of input stimuli that obey a set of declaratively...
Nathan Kitchen, Andreas Kuehlmann
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
14 years 1 months ago
Practical, fast Monte Carlo statistical static timing analysis: why and how
Statistical static timing analysis (SSTA) has emerged as an essential tool for nanoscale designs. Monte Carlo methods are universally employed to validate the accuracy of the appr...
Amith Singhee, Sonia Singhal, Rob A. Rutenbar
WWW
2006
ACM
14 years 5 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
ICML
2000
IEEE
14 years 5 months ago
Eligibility Traces for Off-Policy Policy Evaluation
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
Doina Precup, Richard S. Sutton, Satinder P. Singh

0
posts
with
0
views
255profile views
Lorenzo PareschiProfessor
University of Ferrara
Lorenzo Pareschi