1494 search results - page 3 / 299 » Polynomial time algorithms for network information flow |
178
Voted
JPDC
2006
15 years 3 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
142
Voted
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
CAI
1999
Springer
15 years 3 months ago
1999
Springer
128
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in hi...
140
Voted
ISCC
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...