3356 search results - page 189 / 672 » Computing education for sustainability |
232
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
147
click to vote
SIGCSE
2003
ACM
15 years 12 months ago
2003
ACM
We report the results of a year-long experiment in the use of robots to teach computer science. Our data set compares results from over 800 students on identical tests from both r...
149
click to vote
JCDL
2010
ACM
15 years 8 months ago
2010
ACM
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
196
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
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...