Sciweavers

364 search results - page 72 / 73
» Shortest-path network interdiction
Sort
View
DAC
2004
ACM
14 years 8 months ago
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
Chun-Gi Lyuh, Taewhan Kim
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 2 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
INFOCOM
2003
IEEE
14 years 22 days ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 8 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
ICC
2000
IEEE
137views Communications» more  ICC 2000»
13 years 12 months ago
Internet QoS Routing with IP Telephony and TCP Traffic
— In this paper, we propose the use of QoS routing to enhance the support of IP Telephony. Our proposed scheme is based on QoS intradomain OSPF routing, an extension of the conve...
Alex Dubrovsky, Mario Gerla, Scott Seongwook Lee, ...