Sciweavers

2947 search results - page 528 / 590
» Analyzing Program Analyses
Sort
View
PE
2002
Springer
109views Optimization» more  PE 2002»
14 years 10 months ago
Load-dependent service queues with application to congestion control in broadband networks
: We analyze D/G/1 and M/G/1 queues where the service time for an arrival depends on the amount of work in the system upon arrival. The models are motivated by the bit dropping met...
Kin K. Leung
TON
1998
68views more  TON 1998»
14 years 10 months ago
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
PERVASIVE
2007
Springer
14 years 10 months ago
Securing Pocket Hard Drives
Inexpensive portable storage devices that are available in the market today have made it easier for users to carry data and programs with them and borrow computing platforms when ...
Nishkam Ravi, Chandra Narayanaswami, Mandayam T. R...
JNSM
2008
104views more  JNSM 2008»
14 years 9 months ago
Call Forwarding-Based Active Probing for POTS Fault Isolation
To ensure high availability of telephone services, there is considerable interest in network management activities to develop competent fault management mechanisms. In this paper w...
Chi-Shih Chao, Maitreya Natu, Adarshpal S. Sethi
MP
2010
145views more  MP 2010»
14 years 9 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...