Sciweavers

2249 search results - page 301 / 450
» Representations for category disambiguation
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 10 months ago
An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
Adam Berry, Peter Vamplew
GECCO
2006
Springer
128views Optimization» more  GECCO 2006»
15 years 10 months ago
FTXI: fault tolerance XCS in integer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
Hong-Wei Chen, Ying-Ping Chen
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
A tree-based genetic algorithm for building rectilinear Steiner arborescences
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
William A. Greene
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 10 months ago
Evolutionary design of fault-tolerant analog control for a piezoelectric pipe-crawling robot
In this paper, a genetic algorithm (GA) is used to design faulttolerant analog controllers for a piezoelectric micro-robot. Firstorder and second-order functions are developed to ...
Geoffrey A. Hollinger, David A. Gwaltney