Sciweavers

995 search results - page 21 / 199
» Minimizing Congestion in General Networks
Sort
View
TCAD
2002
73views more  TCAD 2002»
13 years 8 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
JSAC
2006
107views more  JSAC 2006»
13 years 9 months ago
Efficiency and Braess' Paradox under pricing in general networks
We study the flow control and routing decisions of self-interested users in a general congested network where a single profit-maximizing service provider sets prices for different ...
Xin Huang, Asuman E. Ozdaglar, Daron Acemoglu
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 9 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
SLIP
2005
ACM
14 years 2 months ago
Congestion prediction in early stages
Routability optimization has become a major concern in the physical design cycle of VLSI circuits. Due to the recent advances in VLSI technology, interconnect has become a dominan...
Chiu-Wing Sham, Evangeline F. Y. Young
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
14 years 1 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...