Sciweavers

113 search results - page 16 / 23
» Arc Consistency during Search
Sort
View
EUROGP
2006
Springer
136views Optimization» more  EUROGP 2006»
13 years 11 months ago
Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics
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...
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 1 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
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...
Roberto Battiti, Franco Mascia
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 1 months ago
Discovering Frequent Arrangements of Temporal Intervals
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...
EWCBR
2008
Springer
13 years 9 months ago
Noticeably New: Case Reuse in Originality-Driven Tasks
"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...
Belén Díaz-Agudo, Enric Plaza, Juan ...
SOSP
1997
ACM
13 years 9 months ago
Eraser: A Dynamic Data Race Detector for Multi-Threaded Programs
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...