87 search results - page 10 / 18 » On the Completeness of Attack Mutation Algorithms |
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
In an era of cooperating ad hoc networks and pervasive wireless connectivity, we are becoming more vulnerable to malicious attacks. Many of these attacks are silent in nature and ...
AAAI
2010
13 years 8 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
ECOOP
1998
Springer
13 years 11 months ago
1998
Springer
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
ACISP
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...