Sciweavers

1807 search results - page 185 / 362
» Backdoors in the Context of Learning
Sort
View
WCRE
2007
IEEE
14 years 5 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke
HT
2003
ACM
14 years 4 months ago
Is simple sequencing simple adaptive hypermedia?
In this paper, we explore the differences between the Adaptive Hypermedia and IMS Simple Sequencing approaches. Both approaches provide learning material tailored for the learnerâ...
Nor Aniza Abdullah, Hugh C. Davis
ICTAI
1993
IEEE
14 years 2 months ago
Robust Feature Selection Algorithms
Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, adaptive cont...
Haleh Vafaie, Kenneth DeJong
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
14 years 2 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood
ILP
2000
Springer
14 years 2 months ago
Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
Floriana Esposito, Donato Malerba, Francesca A. Li...