2005 search results - page 140 / 401 » Decisive Markov Chains |
IEICET
2007
15 years 1 months ago
2007
The IEEE 802.11 family of specifications is by far the most prominent and successful technique for accessing WLANs. Because the channel used by wireless devices is a time-varying...
94
Voted
RSA
2006
15 years 1 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
TWC
2008
15 years 1 months ago
2008
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
ANOR
2002
15 years 1 months ago
2002
A subgame perfection refinement of Nash equilibrium is suggested for games of the following type: each of an infinite number of identical players selects an action using his privat...
CP
2010
Springer
15 years 6 days ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...