David Saxton

Learn More
We consider an agent’s uncertainty about its environment and the problem of generalizing this uncertainty across states. Specifically, we focus on the problem of exploration in non-tabular reinforcement learning. Drawing inspiration from the intrinsic motivation literature, we use density models to measure uncertainty, and propose a novel algorithm for(More)
OBJECTIVES The aim of this study was to compare the duration and severity of postoperative pain for two different tonsillotomy techniques (radiofrequency [RF] and microdebrider [MD]) with the standard tonsillectomy. METHODS This non-randomised retrospective study, carried out from February 2011 to September 2012, investigated 128 children in two(More)
The notion of a collection of containers for a hypergraph was introduced by the authors in [14]. A collection of containers for a hypergraph G is a collection C of subsets of V (G) such that every independent set I is a subset of some member C ∈ C. (A subset of V (G) is independent if it contains no edge.) The notion was developed further in [15] and(More)
Theorem 7.1 (4.2) Let T be a set of transformation rules. The transformation testing problem is NP-complete for T with star-free rules, where does not appear on the rhs of atomic rules. Remark: Note that the reenement rule r 0 of Section 2 is not star-free, and thus the above theorem does not apply. Nevertheless, the transformation testing for it is in(More)