Sciweavers

2911 search results - page 22 / 583
» A Logic of Graph Constraints
Sort
View
DAC
2003
ACM
14 years 10 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
FUIN
2010
67views more  FUIN 2010»
13 years 7 months ago
Properties of Almost All Graphs and Generalized Quantifiers
We study 0-1 laws for extensions of first-order logic by Lindstr
Anuj Dawar, Erich Grädel
ENTCS
2006
121views more  ENTCS 2006»
13 years 10 months ago
A Logic for Graphs with QoS
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
GianLuigi Ferrari, Alberto Lluch-Lafuente
ASPDAC
2005
ACM
105views Hardware» more  ASPDAC 2005»
13 years 12 months ago
Interconnect estimation without packing via ACG floorplans
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
Jia Wang, Hai Zhou
CCS
2006
ACM
14 years 1 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen