Sciweavers

4345 search results - page 402 / 869
» Temporal Constraint Networks
Sort
View
FMCAD
2007
Springer
16 years 1 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
ISPD
2004
ACM
120views Hardware» more  ISPD 2004»
16 years 9 days ago
On optimal physical synthesis of sleep transistors
Considering the voltage drop constraint over a distributed model for power/ground (P/G) network, we study the following two problems for physical synthesis of sleep transistors: t...
Changbo Long, Jinjun Xiong, Lei He
ATVA
2008
Springer
86views Hardware» more  ATVA 2008»
15 years 8 months ago
NetQi: A Model Checker for Anticipation Game
Abstract. NetQi is a freely available model-checker designed to analyze network incidents such as intrusion. This tool is an implementation of the anticipation game framework, a va...
Elie Bursztein
NETWORKING
2007
15 years 8 months ago
Optimal Rate Allocation in Overlay Content Distribution
This paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of opti...
Chuan Wu, Baochun Li
186
Voted
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 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...