Sciweavers

81 search results - page 7 / 17
» Programming by Demonstration: An Inductive Learning Formulat...
Sort
View
CADE
2008
Springer
15 years 12 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
AIED
2007
Springer
15 years 5 months ago
Predicting Students' Performance with SimStudent: Learning Cognitive Skills from Observation
SimStudent is a machine-learning agent that learns cognitive skills by demonstration. SimStudent was originally built as a building block for Cognitive Tutor Authoring Tools to hel...
Noboru Matsuda, William W. Cohen, Jonathan Sewall,...
ICML
2010
IEEE
15 years 20 days ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
CP
2004
Springer
15 years 5 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
POPL
2008
ACM
15 years 12 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...