500 search results - page 72 / 100 » Approximation algorithms for maximum independent set of pseu... |
115
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
200
click to vote
TON
2010
14 years 8 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
100
click to vote
WABI
2001
Springer
15 years 6 months ago
2001
Springer
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating physical distances between them. It nicely complements...
131
click to vote
COLT
1991
Springer
15 years 5 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
116
click to vote
DCC
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...