791 search results - page 110 / 159 » Approximating the Maximum Sharing Problem |
CORR
2008
Springer
13 years 8 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 ...
WABI
2001
Springer
14 years 8 days 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...
CCR
2006
13 years 8 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
ALGORITHMICA
2010
13 years 8 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
IJCAI
2003
13 years 9 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...