Sciweavers

7092 search results - page 623 / 1419
» Parallelizing constraint programs
Sort
View
CADE
2009
Springer
16 years 7 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
ICTAI
2007
IEEE
16 years 18 days ago
Strong Inverse Consistencies for Non-Binary CSPs
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...
Kostas Stergiou
ICALP
2005
Springer
15 years 11 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ICLP
2004
Springer
15 years 11 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
MOZ
2004
Springer
15 years 11 months ago
A Mozart Implementation of CP(BioNet)
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of an...
Grégoire Dooms, Yves Deville, Pierre Dupont