2974 search results - page 283 / 595 » Model-Driven Constraint Programming |
149
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
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...
177
click to vote
ICLP
2004
Springer
15 years 12 months ago
2004
Springer
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...
195
click to vote
MOZ
2004
Springer
15 years 12 months ago
2004
Springer
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of an...
180
click to vote
BIS
2008
15 years 8 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
200
click to vote
VSTTE
2012
Springer
14 years 2 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...