Sciweavers

1826 search results - page 249 / 366
» Using Random Forests in the Structured Language Model
Sort
View
AIEDU
2005
185views more  AIEDU 2005»
15 years 6 months ago
A Bayesian Student Model without Hidden Nodes and its Comparison with Item Response Theory
The Bayesian framework offers a number of techniques for inferring an individual's knowledge state from evidence of mastery of concepts or skills. A typical application where ...
Michel C. Desmarais, Xiaoming Pu
AAAI
2006
15 years 7 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
IPPS
1999
IEEE
15 years 10 months ago
An Adaptive, Fault-Tolerant Implementation of BSP for JAVA-Based Volunteer Computing Systems
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
Luis F. G. Sarmenta
AGENTS
2001
Springer
15 years 10 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
TOOLS
1992
IEEE
15 years 10 months ago
Write-ing Applications: Design of an Extensible Text Editor as an Application Framework
Using an object-oriented approach, the text editor Write has been designed to be extensible while its basic structure has been kept small and simple. As its main extension concept...
Clemens A. Szyperski