Sciweavers

7092 search results - page 223 / 1419
» Parallelizing constraint programs
Sort
View
APLAS
2000
ACM
15 years 4 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
CP
2009
Springer
16 years 1 months ago
Weakly Monotonic Propagators
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...
Christian Schulte, Guido Tack
87
Voted
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
16 years 1 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
CASES
2009
ACM
15 years 7 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
IDC
2009
Springer
15 years 7 months ago
A Protocol for Execution of Distributed Logic Programs
In the last fifteen years many work in logic programming has focussed on parallel implementations both in shared memory and in distributed memory multiprocessor systems. In both c...
László Aszalós, Andreas Herzi...