Sciweavers

1866 search results - page 336 / 374
» Flexibly Interleaving Processes
Sort
View
ICAI
2008
14 years 11 months ago
Nonrestrictive Concept-Acquisition by Representational Redescription
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
Hui Wei, Yan Chen
IIWAS
2008
14 years 11 months ago
Application framework with demand-driven mashup for selective browsing
Abstract: We are developing a new mashup framework for creating flexible applications in which users can selectively browse through mashup items. The framework provides GUI compone...
Sohei Ikeda, Takakazu Nagamine, Tomio Kamada
UAI
2008
14 years 11 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
IJCAI
2003
14 years 11 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
NIPS
2000
14 years 11 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...