1710 search results - page 37 / 342 » Parallelism in Structured Newton Computations |
EAGC
2004
Springer
14 years 2 months ago
2004
Springer
This paper describes how Condor-pools could be joined together to form a large computational cluster-grid. In the architecture Jini provides the infrastructure for resource lookup,...
JPDC
2006
13 years 8 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
IPPS
1998
IEEE
14 years 28 days ago
1998
IEEE
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
CONCUR
1995
Springer
14 years 7 days ago
1995
Springer
We provide a category theoretic reformulation of control structures, which avoids explicit reference to names. The basis of the formulation is what we call a binding structure, wh...
SC
1995
ACM
14 years 6 days ago
1995
ACM
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates...