The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
We present a noisy-OR Bayesian network model for simulation-based training, and an efficient search-based algorithm for automatic synthesis of plausible training scenarios from co...
Eugene Grois, William H. Hsu, Mikhail Voloshin, Da...
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Ro...
Mixed-initiativesystemspresent the challengeof finding an effective level of interaction betweenhumans and computers. Machinelearning presents a promising approachto this problemi...
One of the most important problems for an intelligent tutoring system is deciding how to respond when a student asks for help. Responding cooperatively requires an understanding o...
Wedescribe somenewpreprocessing techniques that enable faster domain-independentplanning. Thefirst set of techniquesis aimedat inferring state constraints from the structure of pl...
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...