1120 search results - page 215 / 224 » Eager Markov Chains |
102
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
AAAI
2006
15 years 1 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
NETWORKING
2004
15 years 1 months ago
2004
: IEEE 802.11 exhibits both short-term and long-term unfairness [15]. The short-term fairness automatically gives rise to long-term fairness, but not vice versa [11]. When we thoro...
149
click to vote
FOGA
1998
15 years 1 months ago
1998
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
101
click to vote
UAI
2000
15 years 1 months ago
2000
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...