116 search results - page 11 / 24 » Suballowable sequences of permutations |
COR
2010
13 years 7 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
TIT
2008
13 years 7 months ago
2008
The problem of transmission of information over arbitrarily permuted parallel channels is studied here. The transmitter does not know over which channel a certain codesequence will...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...
JCSS
2002
13 years 7 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...