Sciweavers

10988 search results - page 535 / 2198
» Algorithmic Folding Complexity
Sort
View
TCOM
2008
74views more  TCOM 2008»
15 years 7 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
INTEGRATION
2007
69views more  INTEGRATION 2007»
15 years 7 months ago
A fast algorithm for rectilinear block packing based on selected sequence-pair
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
Kunihiro Fujiyoshi, Chikaaki Kodama, Akira Ikeda
COMCOM
2004
111views more  COMCOM 2004»
15 years 7 months ago
An adaptive scheduling algorithm for differentiated services on WDM optical networks
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
Maode Ma, Mounir Hamdi
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
15 years 7 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
JACM
2002
94views more  JACM 2002»
15 years 7 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers