55 search results - page 7 / 11 » Bounds on pseudoexhaustive test lengths |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the d...
CCA
2000
Springer
13 years 11 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
EOR
2007
13 years 7 months ago
2007
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— The priorities of a climbing legged robot are to maintain a grasp on its climbing surface and to climb efficiently against the force of gravity. These priorities profoundly co...
ISSTA
2009
ACM
14 years 1 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...