189 search results - page 15 / 38 » SCARAB: scaling reachability computation on large graphs |
AIPS
1996
14 years 11 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
ACSAC
2006
IEEE
15 years 3 months ago
2006
IEEE
Attack graphs are a valuable tool to network defenders, illustrating paths an attacker can use to gain access to a targeted network. Defenders can then focus their efforts on patc...
AIMS
2007
Springer
15 years 3 months ago
2007
Springer
This paper proposes an optimization method for the design of large scale confederation based BGP networks. We propose a graph based model and an associated metric to evaluate the r...
116
click to vote
ICPADS
1994
IEEE
15 years 1 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...