17298 search results - page 341 / 3460 » Abstract computing machines |
163
click to vote
PVM
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Distributed computing is a means to overcome the limitations of single computing systems. In this paper we describe how clusters of heterogeneous supercomputers can be us...
178
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
120
click to vote
COMPGEOM
1989
ACM
15 years 10 months ago
1989
ACM
d Abstract) Bernard Chazelle Burton Rosenberg Department of Computer Science Princeton University
193
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
141
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Tabulating elliptic curves has been carried out since the earliest days of machine computation in number theory. After some historical remarks, we report on significant r...