Abstract. To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance me...
Leonardo Vanneschi, Steven Gustafson, Giancarlo Ma...
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
"Similar problems have similar solutions" is a basic tenet of case-based inference. However this is not satisfied for CBR systems where the task is to achieve original so...
Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mi...
Stefan Savage, Michael Burrows, Greg Nelson, Patri...