You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
18 years ago | |
|---|---|---|
| .. | ||
| README | 20 years ago | |
| auto | 19 years ago | |
| dice.pctl | 19 years ago | |
| dice.pm | 20 years ago | |
| two_dice.nm | 20 years ago | |
| two_dice.pctl | 20 years ago | |
| two_dice_knuth.pctl | 20 years ago | |
| two_dice_knuth.pm | 20 years ago | |
README
This case study is based on probabilistic algorithms due to Knuth [KY76] which model 6-sided dice using fair coins.
For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/dice.html
=====================================================================================
[KY76]
D. E. Knuth and A. C. Yao
The complexity of nonuniform random number generation
In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, Academic Press, New York, 1976