This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
We explore an application to the game of Go of a reinforcement learning approach based on a linear evaluation function and large numbers of binary features. This strategy has prov...
We consider how an agent should update her uncertainty when it is represented by a set P of probability distributions and the agent observes that a random variable X takes on valu...
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...