Sciweavers

184 search results - page 5 / 37
» Two New Criteria for Comparison in the Bruhat Order
Sort
View
ANOR
2008
76views more  ANOR 2008»
13 years 8 months ago
Performance comparison of several priority schemes with priority jumps
In this paper, we consider several discrete-time priority queues with priority jumps. In a priority scheduling scheme with priority jumps, real-time and non-real-time packets arri...
Tom Maertens, Joris Walraevens, Herwig Bruneel
FMCAD
2004
Springer
14 years 1 months ago
Non-miter-based Combinational Equivalence Checking by Comparing BDDs with Different Variable Orders
This paper describes a new method that is useful in combinational equivalence checking with very challenging industrial designs. The method does not build a miter; instead it build...
In-Ho Moon, Carl Pixley
GCB
2007
Springer
89views Biometrics» more  GCB 2007»
14 years 2 months ago
Expected Gene Order Distances and Model Selection in Bacteria
The most parsimonous distances calculated in pairwise gene order comparisons cannot accurately reflect the true number of events separating two species, unless the number of chan...
Niklas Eriksen
ICSM
2007
IEEE
14 years 2 months ago
Fault Detection Probability Analysis for Coverage-Based Test Suite Reduction
Test suite reduction seeks to reduce the number of test cases in a test suite while retaining a high percentage of the original suite’s fault detection effectiveness. Most appro...
Scott McMaster, Atif M. Memon
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 9 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson