Sciweavers

2864 search results - page 271 / 573
» Constraint Programming in OPL
Sort
View
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
BIS
2008
119views Business» more  BIS 2008»
15 years 7 months ago
Fuzzy Constraint-based Schema Matching Formulation
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 ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
ICFP
2008
ACM
16 years 5 months ago
Type checking with open type functions
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T...