306 search results - page 10 / 62 » On the Minimal Uncompletable Word Problem |
ICALP
2005
Springer
15 years 5 months 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...
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
78
Voted
AMC
2006
14 years 11 months ago
2006
The problem of distinguishing density-independent (DI) from density-dependent (DD) demographic time series is important for understanding the mechanisms that regulate populations ...
106
Voted
CSL
2004
Springer
14 years 11 months ago
2004
Springer
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
MP
2006
14 years 11 months ago
2006
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...