55 search results - page 4 / 11 » Bounds on pseudoexhaustive test lengths |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we address the scheduling problem of multi-mode real-time systems upon uniform multiprocessor platforms. We propose two transition protocols, specified together wit...
SAT
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
TACAS
2005
Springer
14 years 26 days ago
2005
Springer
Object-oriented unit tests consist of sequences of method invocations. Behavior of an invocation depends on the method’s arguments and the state of the receiver at the beginning ...
GIS
2006
ACM
13 years 7 months ago
2006
ACM
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
TIT
2008
13 years 7 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...