19866 search results - page 361 / 3974 » Computing all factorizations in *** |
155
click to vote
PODC
2006
ACM
16 years 23 days ago
2006
ACM
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...
222
click to vote
MEMOCODE
2003
IEEE
16 years 2 days ago
2003
IEEE
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
146
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Experimental data validating some of the proposed parallel computation models on the Intel Paragon is presented. This architecture is characterized by a large bandwidth and a rela...
140
click to vote
MPC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
172
click to vote
IWFM
2003
15 years 8 months ago
2003
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...