s14h
/
prism-accumulation
1
0
Fork 0
Code Releases Activity
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.
132 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: 3b0cc0e571
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '3b0cc0e571'
${ noResults }
prism-accumulation/prism-examples/dice
Mark Kattenbelt 3b0cc0e571
Changed the simulators table mechanism substantially. It is now easier to hide variables (and in future configure more options). It is now the PathTableModel who is responsible for this, making it a lot easier to add variables back to the view. Also added a couple of extra menu options to the pop-up menu. 		20 years ago
..
README Renaming examples directory to prism-examples. 20 years ago
auto Renaming examples directory to prism-examples. 20 years ago
dice.pctl Renaming examples directory to prism-examples. 20 years ago
dice.pm Renaming examples directory to prism-examples. 20 years ago
two_dice.nm Renaming examples directory to prism-examples. 20 years ago
two_dice.pctl Renaming examples directory to prism-examples. 20 years ago
two_dice_knuth.pctl Renaming examples directory to prism-examples. 20 years ago
two_dice_knuth.pm Renaming examples directory to prism-examples. 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