Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
— Despite having a wide-spread applicability of evolutionary optimization procedures over the past few decades, EA researchers still face criticism about the theoretical optimali...
Kalyanmoy Deb, Rahul Tewari, Mayur Dixit, Joydeep ...
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
In this paper, we describe an experiment to evolve oral tract (mouth) shapes for a set of vowels for two adult males. Target vowels were recorded in an acoustically anechoic room ...
David M. Howard, Andy M. Tyrrell, Crispin H. V. Co...
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...