5785 search results - page 152 / 1157 » Approximability of Probability Distributions |
142
Voted
FPL
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a hardware architecture for non-uniform random number generation, which allows the generator's distribution to be modified at run-time without reconfigura...
141
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
118
Voted
FOSSACS
2003
Springer
15 years 8 months ago
2003
Springer
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
134
Voted
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
119
Voted
EUROGP
2008
Springer
15 years 5 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...