596 search results - page 46 / 120 » Complexity Analysis by Graph Rewriting |
ACSAC
2003
IEEE
14 years 1 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
HCW
1999
IEEE
14 years 8 days ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
DIALM
2005
ACM
13 years 10 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...