2930 search results - page 176 / 586 » The optimal sequence compression |
148
Voted
DISOPT
2008
15 years 3 months ago
2008
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
156
click to vote
ACL
2010
15 years 2 months ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
139
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
127
click to vote
CPAIOR
2009
Springer
15 years 10 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...
138
click to vote
CPM
2010
Springer
15 years 9 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...