1429 search results - page 103 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
FLAIRS
2007
13 years 11 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
AAAI
2012
11 years 11 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
COMCOM
1998
13 years 9 months ago
1998
—We examine the applicability of existing IP multicast mechanisms for Point-to-Point links such as wired and wireless telephone lines. We identify problems such as overhead due t...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Limited bandwidth and high packet loss pose a serious challenge for video streaming over wireless networks. Even when packet loss in the medium is not present, the fluctuating ava...
ICCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...