Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...
Test adequacy criteria provide the engineer with guidance on how to populate test suites. While adequacy criteria have long been a focus of research, existing testing methods do no...
Matthew J. Rutherford, Antonio Carzaniga, Alexande...
Genetic algorithms (GAs) have been applied previously to UML-driven, stress test requirements generation with the aim of increasing chances of discovering faults relating to networ...
Abstract. We present two light-weight worm detection algorithms that offer significant advantages over fixed-threshold methods. The first algorithm, RBS (ratebased sequential hy...
Dendritic Cells (DCs) are innate immune system cells which have the power to activate or suppress the ystem. The behaviour of human DCs is abstracted to form an algorithm suitable...