2254 search results - page 72 / 451 » Computing the minimal covering set |
ICDCSW
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper, several enhanced sufficient conditions are given for minimal routing in 2-dimensional (2-D) meshes with faulty nodes contained in a set of disjoint faulty blocks. ...
CAV
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
JNSM
2008
13 years 10 months ago
2008
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
JAL
2006
13 years 10 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
AINA
2010
IEEE
14 years 3 months ago
2010
IEEE
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...