Sciweavers

2941 search results - page 150 / 589
» The Myth of the Educational Computer
Sort
View
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 4 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 4 months ago
The computational power of population protocols
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 ...
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 4 months ago
The Computational Complexity of Probabilistic Planning
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...
SIGCSE
2002
ACM
118views Education» more  SIGCSE 2002»
15 years 4 months ago
A proposed undergraduate bioinformatics curriculum for computer scientists
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...
CORR
2011
Springer
206views Education» more  CORR 2011»
14 years 11 months ago
Arrangement Computation for Planar Algebraic Curves
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...