Sciweavers

7092 search results - page 221 / 1419
» Parallelizing constraint programs
Sort
View
AGP
1999
IEEE
15 years 4 months ago
Extending clp(FD) by Negative Constraint Solving
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
Antonio J. Fernández, Patricia M. Hill
101
Voted
CORR
2007
Springer
147views Education» more  CORR 2007»
15 years 15 days ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
PDCAT
2005
Springer
15 years 6 months ago
Performance Comparison between VOPP and MPI
View-Oriented Parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into v...
Zhiyi Huang, Martin K. Purvis, Paul Werstein
99
Voted
ISSRE
2007
IEEE
15 years 2 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...
PPDP
2001
Springer
15 years 5 months ago
When Do Bounds and Domain Propagation Lead to the Same Search Space?
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
Christian Schulte, Peter J. Stuckey