Sciweavers

511 search results - page 60 / 103
» TSP with bounded metrics
Sort
View
CAV
2004
Springer
77views Hardware» more  CAV 2004»
15 years 3 months ago
Understanding Counterexamples with explain
The counterexamples produced by model checkers are often lengthy and difficult to understand. In practical verification, showing the existence of a (potential) bug is not enough: ...
Alex Groce, Daniel Kroening, Flavio Lerda
RTSS
2002
IEEE
15 years 2 months ago
Dynamic Scan Scheduling
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...
Bruno Dutertre
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 1 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
ICALP
1992
Springer
15 years 1 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
ACSD
2003
IEEE
102views Hardware» more  ACSD 2003»
15 years 1 months ago
Specification Coverage Aided Test Selection
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
Tuomo Pyhälä, Keijo Heljanko