Sciweavers

165 search results - page 21 / 33
» Teaching Randomized Learners
Sort
View
KBSE
2002
IEEE
14 years 25 days ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic
JAIR
2008
93views more  JAIR 2008»
13 years 7 months ago
Spectrum of Variable-Random Trees
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou
COLT
1992
Springer
13 years 12 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
ACMSE
2006
ACM
14 years 1 months ago
Computer tutoring for programming education
Software is increasingly pervasive in the products we use. Consequently, more programmers are needed to develop the software, and consequently there is unmet demand on programming...
Susan Eitelman
ITRE
2005
IEEE
14 years 1 months ago
Some studies and lessons learned from ad hoc learning
This work proposes concepts, designs, experiences and lessons learned from some studies of ad hoc learning supported by wireless and mobile technologies. The ad hoc learning activi...
Chih-Yung Chang, Yuh-Shyan Chen, Tai-Chien Kao, Ja...