Sciweavers

20197 search results - page 459 / 4040
» Comparing Computational Power
Sort
View
PODC
2006
ACM
16 years 25 days ago
Stably computable predicates are semilinear
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
Dana Angluin, James Aspnes, David Eisenstat
IWFM
2003
123views Formal Methods» more  IWFM 2003»
15 years 8 months ago
Logic for Computational Effects: Work in Progress
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
Gordon D. Plotkin, John Power
SIGCOMM
2010
ACM
15 years 7 months ago
The case for crowd computing
We introduce and motivate crowd computing, which combines mobile devices and social interactions to achieve large-scale distributed computation. An opportunistic network of mobile...
Derek Gordon Murray, Eiko Yoneki, Jon Crowcroft, S...
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Computer algebra in systems biology
Systems biology focuses on the study of entire biological systems rather than on their individual components. With the emergence of high-throughput data generation technologies for...
Reinhard C. Laubenbacher, Bernd Sturmfels
ATAL
2005
Springer
16 years 13 days ago
A drosophila for computational dialectics
Systems of argumentation or ’computational dialectic’ are emerging as a powerful means of structuring inter-agent communication in multi-agent systems. Individual systems of c...
Simon Wells, Chris Reed