Sciweavers

7092 search results - page 218 / 1419
» Parallelizing constraint programs
Sort
View
74
Voted
EOR
2007
80views more  EOR 2007»
15 years 14 days ago
Exploiting nested inequalities and surrogate constraints
The exploitation of nested inequalities and surrogate constraints as originally proposed in Glover [Glover, F., 1965. A multiphase-dual algorithm for the zero–one integer progra...
Saïd Hanafi, Fred Glover
141
Voted
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...
SCP
2000
135views more  SCP 2000»
15 years 8 days ago
A calculus of functional BSP programs
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
Frédéric Loulergue, Gaétan Ha...
117
Voted
ICFP
2008
ACM
16 years 14 days ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
105
Voted
SPAA
1995
ACM
15 years 4 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias