The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
Kevin Waugh, Martin Zinkevich, Michael Johanson, M...
Future Grid Networks should be able to provide Quality of Service (QoS) guarantees to their users. In this work we propose a framework for Grid Networks that provides deterministi...
Panagiotis C. Kokkinos, Emmanouel A. Varvarigos, N...
Abstract—Putative brain processes responsible for understanding language are based on spreading activation in semantic networks, providing enhanced representations that involve c...
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen