830 search results - page 2 / 166 » Generalizing Global Constraints Based on Network Flows |
WWW
2005
ACM
14 years 6 months ago
2005
ACM
We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver ...
TCAD
2002
13 years 5 months ago
2002
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...
NETWORKS
2006
13 years 5 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
ICCD
2007
IEEE
14 years 2 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
INFOCOM
2003
IEEE
13 years 11 months ago
2003
IEEE
—Network flow control regulates the traffic between sources and links based on congestion, and plays a critical role in ensuring satisfactory performance. In recent studies, glob...