706 search results - page 95 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
DAM
2011
13 years 3 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
JNSM
2008
13 years 8 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...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
AIPS
2006
13 years 10 months ago
2006
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...