3192 search results - page 345 / 639 » The minimum latency problem |
170
click to vote
ICMCS
2005
IEEE
16 years 8 days ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
202
click to vote
ESA
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
173
click to vote
WAOA
2005
Springer
16 years 4 days ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
193
click to vote
MFCS
2004
Springer
16 years 19 hour ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
187
click to vote
HIPC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...