Sciweavers

6087 search results - page 783 / 1218
» Knowledge discovery methods
Sort
View
ECML
1997
Springer
15 years 11 months ago
Constructing Intermediate Concepts by Decomposition of Real Functions
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
Janez Demsar, Blaz Zupan, Marko Bohanec, Ivan Brat...
ICML
1996
IEEE
15 years 11 months ago
Discovering Structure in Multiple Learning Tasks: The TC Algorithm
Recently, there has been an increased interest in "lifelong" machine learning methods, that transfer knowledge across multiple learning tasks. Such methods have repeated...
Sebastian Thrun, Joseph O'Sullivan
ICRA
1993
IEEE
108views Robotics» more  ICRA 1993»
15 years 11 months ago
Models for Diagnosing Robot Error Sources
Accuracy of a machine is determined by its ability to position and orient a tool at a prescribed point. Usually this positioning is performed by positioning joints (actuators The ...
Louis J. Everett
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 10 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
CP
2006
Springer
15 years 10 months ago
Preprocessing QBF
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
Horst Samulowitz, Jessica Davies, Fahiem Bacchus