Sciweavers

997 search results - page 13 / 200
» Completely Lazy Learning
Sort
View
ECML
2007
Springer
14 years 4 months ago
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
Stephan Timmer, Martin Riedmiller
DAC
2006
ACM
14 years 10 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
NIPS
2004
13 years 11 months ago
Instance-Specific Bayesian Model Averaging for Classification
Classification algorithms typically induce population-wide models that are trained to perform well on average on expected future instances. We introduce a Bayesian framework for l...
Shyam Visweswaran, Gregory F. Cooper
CP
2009
Springer
14 years 4 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
SIGSOFT
2009
ACM
14 years 10 months ago
Learning from examples to improve code completion systems
The suggestions made by current IDE's code completion features are based exclusively on static type system of the programming language. As a result, often proposals are made ...
Marcel Bruch, Martin Monperrus, Mira Mezini