An important goal of the theory of genetic algorithms is to build predictive models of how well genetic algorithms are expected to perform, given a representation, a fitness lands...
We introduce a constrained mechanism design setting called internal implementation, in which the mechanism designer is explicitly modeled as a player in the game of interest. This...
Abstract. Symbolic reasoning is in the core of many software development tools such as: bug-finders, test-case generators, and verifiers. Of renewed interest is the use of symbolic...
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...
In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring variab...
Marek Ostaszewski, Pascal Bouvry, Franciszek Sered...