57 search results - page 10 / 12 » Combinatorial algorithms for the minimum interval cost flow ... |
ICNP
1998
IEEE
13 years 12 months ago
1998
IEEE
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
STOC
2010
ACM
14 years 17 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...