47 search results - page 2 / 10 » Computing True Shadow Prices in Linear Programming |
TMC
2008
13 years 5 months ago
2008
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
IOR
2007
13 years 5 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
JMLR
2006
13 years 5 months ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
CCGRID
2010
IEEE
13 years 6 months ago
2010
IEEE
The MPI programming model hides network type and topology from developers, but also allows them to seamlessly distribute a computational job across multiple cores in both an intra ...