Sciweavers

753 search results - page 64 / 151
» Completing a (k - 1)-Assignment
Sort
View
SIGCSE
2010
ACM
158views Education» more  SIGCSE 2010»
14 years 10 months ago
The benefits of pairing by ability
An analysis of data from 259 CS1 students is performed to compare the performance of students who were paired by demonstrated ability to that of students who were paired randomly ...
Grant Braught, John MacCormick, Tim Wahls
CORR
2010
Springer
92views Education» more  CORR 2010»
14 years 10 months ago
The Complexity of Finding Reset Words in Finite Automata
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
Jörg Olschewski, Michael Ummels
CSDA
2008
62views more  CSDA 2008»
14 years 10 months ago
Waiting time distribution of generalized later patterns
In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
Donald E. K. Martin, John A. D. Aston
CORR
2006
Springer
83views Education» more  CORR 2006»
14 years 10 months ago
How to Beat the Adaptive Multi-Armed Bandit
The multi-armed bandit is a concise model for the problem of iterated decision-making under uncertainty. In each round, a gambler must pull one of K arms of a slot machine, withou...
Varsha Dani, Thomas P. Hayes
CSDA
2006
107views more  CSDA 2006»
14 years 10 months ago
Optimal confidence interval for the largest normal mean under heteroscedasticity
A two-stage sampling procedure for obtaining an optimal confidence interval for the largest or smallest mean of k independent normal populations is proposed, where the population ...
Hubert J. Chen, Miin-Jye Wen