搜索资源列表
Millrab
- 经典的MillRab(蒙特卡罗)概率算法,用于素数测试。蒙特卡罗算法的错误概率不超过 (1/4)^k,k为算法的运行次数。-classic MillRab (Monte Carlo) probabilistic algorithm for testing in a few. Monte Carlo algorithm error probability less than (1 / 4) ^ k, k algorithm for the operation frequency.
huffmanenc
- huffman编码的程序 根据huffman算法统计概率 算出码书 然后编码
shijianbuchangfa
- 用时间步长法实现:某仓库有一个保管员,领料工人的到达为Poisson流,平均每小时有12个工人来领料,每个工人的领料时间均匀分布在2-4分钟之间,求该保管员忙的概率。-Time step method: a custodian of a warehouse, picking the arrival of workers to a Poisson stream, hour average of 12 workers picking, each worker picking time uniform
bayesian0930
- j简单的贝叶斯模型数据概率求解问题,有助于理解贝叶斯模型数据分析过程。-j simple Bayesian probability model data to solve problems, help to understand the Bayesian model data analysis process.
Rock-Paper-Scissors
- 剪刀石头布小程序,电脑自动进行游戏,最后分别计算出两方获胜的概率和平的概率-Rock Paper Scissors small program, the computer automatically for the game, the two sides finally calculate the probability of winning the peace probabilities
Slot
- 功能比较全面的老虎机程序,可以自己修改源代码控制概率。-Slot machine features a more comprehensive program, you can edit your source code control probability.
Huffman_code
- Huffman编码 1、将信号源的符号按照出现概率递减的顺序排列。 2、将两个最小出现概率进行合并相加,得到的结果作为新符号的出现概率。 3、重复进行步骤1和2直到概率相加的结果等于1为止。 4、在合并运算时,概率大的符号用编码0表示,概率小的符号用编码1表示。 5、记录下概率为1处到当前信号源符号之间的0,l序列,从而得到每个符号的编码。-Huffman coding 1. Source symbols are arranged in order of decreasing