The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
—We consider a scenario in which users share an access point and are mainly interested in VoIP applications. Each user is allowed to adapt to varying network conditions by choosi...
Peer-to-Peer (P2P) networks are gaining increasing popularity in many distributed applications such as file-sharing, network storage, web caching, searching and indexing of releva...
In this paper we analyze a novel paradigm of reliable communication which is not based on the traditional timeout-andretransmit mechanism of TCP. Our approach, which we call Fount...