#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1973

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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)

- David Saxton
- J. Comb. Theory, Ser. A
- 2011

- Levente Deak, David Saxton, Keith Johnston, Palma Benedek, Gábor Katona
- Sultan Qaboos University medical journal
- 2014

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)

- Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan
- J. London Math. Society
- 2014

Ramsey theory, basics r(n, s): smallest N such that any colouring of the edges of K N with blue and red contains a blue clique on n vertices or a red clique on s vertices

- David Saxton, Andrew Thomason
- Combinatorics, Probability & Computing
- 2012

- David Saxton, Andrew Thomason
- Combinatorics, Probability & Computing
- 2016

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)

- David Saxton
- J. Comb. Theory, Ser. A
- 2013

We build deep RL agents that execute declarative programs expressed in formal language. The agents learn to ground the terms in this language in their environment, and can generalize their behavior at test time to execute new programs that refer to objects that were not referenced during training. The agents develop disentangled interpretable… (More)

- S F Agmml, W Altschul, +11 authors S A Benner
- 1995

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)

- D F Saxton
- Nursing
- 1996