Sciweavers

4930 search results - page 116 / 986
» Learning minimal abstractions
Sort
View
ICML
2007
IEEE
16 years 1 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
TAMC
2007
Springer
15 years 6 months ago
A Characterization of the Language Classes Learnable with Correction Queries
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
Cristina Tîrnauca, Satoshi Kobayashi
ECIS
2000
15 years 2 months ago
Work-Based Learning and Knowledge Management: An Integrated Concept of Organizational Learning
Abstract - Organizational learning requires individual learning. Individual learning has to interact in a dynamic social environment in order to contribute to organizational learni...
Sabine Seufert
114
Voted
DATE
2005
IEEE
150views Hardware» more  DATE 2005»
15 years 6 months ago
Pueblo: A Modern Pseudo-Boolean SAT Solver
This paper introduces a new SAT solver that integrates logicbased reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an eff...
Hossein M. Sheini, Karem A. Sakallah
92
Voted
ICES
2003
Springer
86views Hardware» more  ICES 2003»
15 years 5 months ago
A Note on Designing Logical Circuits Using SAT
Abstract. We present a systematic procedure for the synthesis and minimisation of digital circuits using propositional satisfiability. We encode the truth table into a canonical s...
Giovani Gomez Estrada