Sciweavers

1805 search results - page 208 / 361
» Functional programming with structured graphs
Sort
View
ICLP
2011
Springer
14 years 4 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 5 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
124
Voted
PLDI
2004
ACM
15 years 6 months ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman
SNPD
2003
15 years 2 months ago
Semantics of Minimally Synchronous Parallel ML
This paper presents a new functional parallel language: Minimally Synchronous Parallel ML. The execution time can then be estimated and dead-locks and indeterminism are avoided. I...
Myrto Arapinis, Frédéric Loulergue, ...
KIVS
2005
Springer
15 years 7 months ago
A Case for Lightweight SuperPeer Topologies
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou