Sciweavers

3643 search results - page 264 / 729
» Learning Submodular Functions
Sort
View
ICML
2003
IEEE
16 years 7 months ago
TD(0) Converges Provably Faster than the Residual Gradient Algorithm
In Reinforcement Learning (RL) there has been some experimental evidence that the residual gradient algorithm converges slower than the TD(0) algorithm. In this paper, we use the ...
Ralf Schoknecht, Artur Merke
ICALT
2007
IEEE
16 years 28 days ago
Authoring of Adaptive Educational Hypermedia
In this paper we propose a set of development guidelines for an adaptive authoring environment of adaptive educational hypermedia. This set consists of relevant and necessary funct...
Alexandra I. Cristea
ICANN
2007
Springer
16 years 23 days ago
MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
Leonardo Franco, José Luis Subirats, Jos&ea...
CIKM
2003
Springer
15 years 12 months ago
Lessons from the implementation of an adaptive parts acquisition ePortal
In recent work we have developed a novel approach to the design and implementation of an online portal (ePortal) to help application engineers find replacements for electronic par...
Rafael Alonso, Jeffrey A. Bloom, Hua Li
ICML
1989
IEEE
15 years 10 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning