Sciweavers

223 search results - page 36 / 45
» Information-based Case Grammar
Sort
View
ASE
2010
129views more  ASE 2010»
14 years 9 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
CJ
2008
97views more  CJ 2008»
14 years 9 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
AIEDU
2006
77views more  AIEDU 2006»
14 years 9 months ago
Constraint-based Modeling and Ambiguity
Constraint-based modeling has been used in many application areas of Intelligent Tutoring Systems as a powerful means to analyse erroneous student solutions and generate helpful fe...
Wolfgang Menzel
JIIS
2008
89views more  JIIS 2008»
14 years 9 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
ENTCS
2007
126views more  ENTCS 2007»
14 years 9 months ago
Nominal Reasoning Techniques in Coq: (Extended Abstract)
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
Brian E. Aydemir, Aaron Bohannon, Stephanie Weiric...