Sciweavers

5922 search results - page 508 / 1185
» Navigability of Complex Networks
Sort
View
ICCS
2004
Springer
15 years 11 months ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo
DSN
2002
IEEE
15 years 11 months ago
Evaluation of the Maximum Level Reached by a Queue Over a Finite Period
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
Gerardo Rubino
HICSS
2002
IEEE
105views Biometrics» more  HICSS 2002»
15 years 11 months ago
The Back-Office of E-government (Managing Information Domains as Political Economies)
Many governmental organizations nowadays are setting up e-government initiatives to improve the delivery of services to citizens. Often, these initiatives require information exch...
Vincent Homburg, Victor Bekkers
ICMCS
2000
IEEE
91views Multimedia» more  ICMCS 2000»
15 years 10 months ago
Distributed QoS Routing for Multimedia Traffic
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algo...
Venkatesh Sarangan, Donna Ghosh, Raj Acharya
BROADNETS
2004
IEEE
15 years 10 months ago
Power Efficient Broadcast Scheduling with Delay Deadlines
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
Dinesh Rajan, Ashutosh Sabharwal, Behnaam Aazhang