We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
We consider the model of population protocols introduced by Angluin et al. [AAD+ 04], in which anonymous finite-state agents stably compute a predicate of the multiset of their in...
Dana Angluin, James Aspnes, David Eisenstat, Eric ...
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
Bioinformatics is a new and rapidly evolving discipline that has emerged from the fields of experimental molecular biology and biochemistry, and from the the artificial intelligen...
Travis E. Doom, Michael L. Raymer, Dan E. Krane, O...
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...