Sciweavers

7092 search results - page 11 / 1419
» Parallelizing constraint programs
Sort
View
POPL
1992
ACM
14 years 1 months ago
Semantic Foundations of Jade
Jade is a language designed to support coarse-grain parallelism on both shared and distributed addressspace machines. Jade is data-oriented: a Jade programmer simply augments a se...
Martin C. Rinard, Monica S. Lam
CVPR
2006
IEEE
14 years 11 months ago
Reconstruction with Interval Constraints Propagation
In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account...
Michela Farenzena, Andrea Fusiello, Agostino Dovie...
APPT
2003
Springer
14 years 2 months ago
Scheduling Outages in Distributed Environments
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
Anthony Butler, Hema Sharda, David Taniar
CORR
2002
Springer
133views Education» more  CORR 2002»
13 years 8 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young
POPL
2007
ACM
14 years 9 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann