Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
How good are branching rules in DPLL?
Discrete Applied Mathematics
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Introduction to algorithms
Self-Nonself Discrimination in a Computer
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
An Immunological Approach to Change Detection: Algorithms, Analysis and Implications
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
The effect of binary matching rules in negative selection
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Discriminating self from non-self with finite mixtures of multivariate Bernoulli distributions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Efficient Algorithms for String-Based Negative Selection
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
Negative selection algorithms on strings with efficient training and linear-time classification
Theoretical Computer Science
Review Article: Recent Advances in Artificial Immune Systems: Models and Applications
Applied Soft Computing
Hybrid negative selection approach for anomaly detection
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
| Hi-index | 0.00 |
The problem of generating r-contiguous detectors in negative selection can be transformed in the problem of finding assignment sets for a Boolean formula in k-CNF. Knowing this crucial fact enables us to explore the computational complexity and the feasibility of finding detectors with respect to the number of self bit strings |S|, the bit string length l and matching length r. It turns out that finding detectors is hardest in the phase transition region, which is characterized by certain combinations of parameters |S|, l and r. This insight is derived by investigating the r-contiguous matching probability in a random search approach and by using the equivalent k-CNF problem formulation.