92 search results - page 1 / 19 » Minimizing Expected Attacking Cost in Networks |
ENDM
2010
13 years 5 months ago
2010
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
ATAL
2003
Springer
13 years 10 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
NETWORKS
2010
13 years 3 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
ACSAC
2003
IEEE
13 years 10 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...
JSAC
2006
13 years 4 months ago
2006
In defending against various network attacks, such as distributed denial-of-service (DDoS) attacks or worm attacks, a defense system needs to deal with various network conditions a...