2477 search results - page 347 / 496 » Parallelizing Functional Programs by Generalization |
158
Voted
JGO
2010
15 years 28 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
189
Voted
FMICS
2007
Springer
16 years 9 days ago
2007
Springer
Message passing using libraries implementing the Message Passing Interface (MPI) standard is the dominant communication mechanism in high performance computing (HPC) applications. ...
176
Voted
ISCAPDCS
2001
15 years 7 months ago
2001
One purpose of the end-user tools described in this paper is to give users a graphical representation of performance information that has been gathered by instrumenting an applica...
182
Voted
QNS
1996
15 years 7 months ago
1996
Inferno is an operating system well suited to applications that need to be portable, graphical, and networked. This paper describes the fundamental
oating point facilities of the...
144
Voted
IWMM
2007
Springer
16 years 8 days ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...