1160 search results - page 9 / 232 » Revisiting the Sequence Constraint |
DNA
2005
Springer
15 years 7 months ago
2005
Springer
We survey the biochemical constraints useful for the design of DNA code words for DNA computation. We define the DNA/RNA Code Constraint problem and cover biochemistry topics rel...
99
Voted
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Documents, especially long ones, may contain very diverse passages related to different topics. Passages Retrieval approaches have shown that, in most cases, there is a great pote...
105
Voted
DM
2006
15 years 1 months ago
2006
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n-1 -2 n-1 2 . Construction of Boolean function...
102
Voted
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
121
Voted
TCS
2010
14 years 8 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...