33 search results - page 6 / 7 » Computing Approximate Blocking Probabilities for a Class of ... |
WEA
2010
Springer
14 years 11 days ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
ICC
2007
IEEE
13 years 12 months ago
2007
IEEE
—The need to quickly and accurately classify Internet traffic for security and QoS control has been increasing significantly with the growing Internet traffic and applications ov...
NIPS
2007
13 years 7 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
PODC
2005
ACM
13 years 11 months ago
2005
ACM
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
ETT
2002
13 years 5 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...