364 search results - page 57 / 73 » Shortest-path network interdiction |
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
WIOPT
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
CPAIOR
2010
Springer
14 years 14 days ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
ICS
1994
Tsinghua U.
13 years 11 months ago
1994
Tsinghua U.
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...