49 search results - page 4 / 10 » A fast polynomial time algorithm for logistics network flows |
108
Voted
WADS
1995
Springer
15 years 7 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
123
Voted
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...
97
Voted
NIPS
1993
15 years 5 months ago
1993
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
136
Voted
PERCOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
115
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...