2069 search results - page 130 / 414 » Linear time algorithms for Clobber |
136
click to vote
PDPTA
2007
15 years 5 months ago
2007
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
122
click to vote
RECOMB
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. There have been many widely used genome rearrangement models, such as reversals, HannenhalliPevzner, and double-cut and join. Though each one can be precisely defined, t...
136
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several pr...
199
click to vote
DCC
2011
IEEE
14 years 11 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
126
click to vote
CCCG
2008
15 years 5 months ago
2008
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, w...