Sciweavers

6 search results - page 1 / 2
» Upgrading arcs to minimize the maximum travel time in a netw...
Sort
View
NETWORKS
2006
13 years 10 months ago
Upgrading arcs to minimize the maximum travel time in a network
Ann Melissa Campbell, Timothy J. Lowe, Li Zhang
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
VLSISP
2002
112views more  VLSISP 2002»
13 years 10 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 4 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
FOCS
1997
IEEE
14 years 3 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...