Sciweavers

1998 search results - page 224 / 400
» Basic Association Rules
Sort
View
GECCO
2003
Springer
105views Optimization» more  GECCO 2003»
15 years 9 months ago
The Underlying Similarity of Diversity Measures Used in Evolutionary Computation
In this paper we compare and analyze the various diversity measures used in the Evolutionary Computation field. While each measure looks quite different from the others in form, we...
Mark Wineberg, Franz Oppacher
ICCS
2003
Springer
15 years 9 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 9 months ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
IWPC
2002
IEEE
15 years 8 months ago
Pattern-Supported Architecture Recovery
Architectural patterns and styles represent important design decisions and thus are valuable abstractions for architecture recovery. Recognizing them is a challenge because styles...
Martin Pinzger, Harald Gall
128
Voted
LORI
2009
Springer
15 years 8 months ago
Intentions and Assignments
Abstract. The aim of this work is propose a logical approach to intention dynamics based on the notion of assignment [7, 3]. The function of an assignment is to associate the truth...
Emiliano Lorini, Mehdi Dastani, Hans P. van Ditmar...