Sciweavers

632 search results - page 101 / 127
» On Routing in Circulant Graphs
Sort
View
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 2 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
PADS
2006
ACM
14 years 2 months ago
Modeling Autonomous-System Relationships
The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocol...
Xenofontas A. Dimitropoulos, George F. Riley
FPGA
2005
ACM
80views FPGA» more  FPGA 2005»
14 years 2 months ago
Simultaneous timing-driven placement and duplication
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
Gang Chen, Jason Cong
INFOCOM
2002
IEEE
14 years 1 months ago
Using the Small-World Model to Improve Freenet Performance
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 27 days ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...