Sciweavers

830 search results - page 25 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
13 years 11 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
CONEXT
2010
ACM
13 years 5 months ago
The Internet is flat: modeling the transition from a transit hierarchy to a peering mesh
Recent measurements and anecdotal evidence indicate that the Internet ecosystem is rapidly evolving from a multi-tier hierarchy built mostly with transit (customer-provider) links...
Amogh Dhamdhere, Constantine Dovrolis
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 7 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
14 years 4 months ago
A flexibility aware budgeting for hierarchical flow timing closure
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
Olivier Omedes, Michel Robert, Mohammed Ramdani
CCE
2004
13 years 7 months ago
A general modeling framework for the operational planning of petroleum supply chains
In the literature, optimization models deal with planning and scheduling of several subsystems of the petroleum supply chain such as oilfield infrastructure, crude oil supply, ref...
Sérgio M. S. Neiro, José M. Pinto