Sciweavers

4930 search results - page 255 / 986
» Learning minimal abstractions
Sort
View
TCS
1998
15 years 6 months ago
Unary PCF is Decidable
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
Ralph Loader
TIFS
2010
120views more  TIFS 2010»
15 years 1 months ago
Gibbs Construction in Steganography
Abstract--We make a connection between steganography design by minimizing embedding distortion and statistical physics. The unique aspect of this work and one that distinguishes it...
Tomás Filler, Jessica J. Fridrich
IROS
2009
IEEE
180views Robotics» more  IROS 2009»
16 years 1 months ago
Control of redundant robots using learned models: An operational space control approach
Abstract— We present an adaptive control approach combining forward kinematics model learning methods with the operational space control approach. This combination endows the rob...
Camille Salaün, Vincent Padois, Olivier Sigau...
AIED
2009
Springer
16 years 1 months ago
Intelligent Learning Object Guide (iLOG): A Framework for Automatic Empirically-Based Metadata Generation
Abstract. We present a framework for the automatic annotation of learning objects (LOs) with empirical usage metadata. Our implementation of the Intelligent Learning Object Guide (...
S. A. Riley, Lee Dee Miller, Leen-Kiat Soh, Ashok ...
175
Voted
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
16 years 1 months ago
Considering Unseen States as Impossible in Factored Reinforcement Learning
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...