Results 251 to 260 of about 30,121,162 (303)
Exp HematolSome of the next articles are maybe not open access.
Related searches:
Related searches:
The sorting techniques: a tutorial paper on card sorts, picture sorts and item sorts
Expert Systems, 1997Although sorting techniques (e.g. card sorts) are widely used in knowledge acquisition and requirements acquisition, they have received little formal attention compared to related techniques such as repertory grids and laddering. This paper briefly describes the main sorting techniques, then provides a detailed tutorial on one variety (repeated single ...
Gordon Rugg, Peter McGeorge
openaire +2 more sources
SSRN Electronic Journal, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ayça Kaya, Galina Vereshchagina
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ayça Kaya, Galina Vereshchagina
openaire +1 more source
Accident and Emergency Nursing, 1997
Each year in Accident and Emergency an increasing number of young people present with acute problems related to social drugs. These problems range from mild symptoms to life-threatening conditions, many of which can be extremely difficult and time consuming for staff to manage.
openaire +2 more sources
Each year in Accident and Emergency an increasing number of young people present with acute problems related to social drugs. These problems range from mild symptoms to life-threatening conditions, many of which can be extremely difficult and time consuming for staff to manage.
openaire +2 more sources
ACM Computing Surveys, 1971
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples.
openaire +3 more sources
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples.
openaire +3 more sources
Sorting, Approximate Sorting, and Searching in Rounds
SIAM Journal on Discrete Mathematics, 1988The worst case number of comparisons needed for sorting or selecting in rounds is considered. The following results are obtained. (a) For every fixed \(k\geq 2\), \(\Omega (n^{1+1/k}(\log n)^{1/k})\) comparisons are required to sort n elements in k rounds. \((O(n^{1+1/k}\log n)\) are known to be sufficient.) This improves the previously known bounds by
Noga Alon, Yossi Azar
openaire +3 more sources
SIAM Journal on Discrete Mathematics, 1998
Summary: Sequence comparisons in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e., insertions, deletions, and substitutions of nucleotides) and ignore global rearrangements (i.e., inversions and ...
Vineet Bafna, Pavel A. Pevzner
openaire +2 more sources
Summary: Sequence comparisons in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e., insertions, deletions, and substitutions of nucleotides) and ignore global rearrangements (i.e., inversions and ...
Vineet Bafna, Pavel A. Pevzner
openaire +2 more sources
IEEE Transactions on Computers, 1985
The problem of sorting a file distributed over a number of sites of a communication network is examined. Two versions of this problem are investigated; distributed solution algorithms are presented; and their communication complexity analyzed both in the worst and in the average case.
Doron Rotem +2 more
openaire +2 more sources
The problem of sorting a file distributed over a number of sites of a communication network is examined. Two versions of this problem are investigated; distributed solution algorithms are presented; and their communication complexity analyzed both in the worst and in the average case.
Doron Rotem +2 more
openaire +2 more sources
Fundamenta Informaticae, 2006
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case.
Joachim Giesen +2 more
openaire +3 more sources
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case.
Joachim Giesen +2 more
openaire +3 more sources