We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
Today’s low cost wireless phones have driven a need to be able to economically test high volumes of complex RF IC’s at a fraction of the cost of the IC. In June of 2001 the IB...
New rotationally invariant texture feature extraction methods are introduced that utilise the dual tree complex wavelet transform (DT-CWT). The complex wavelet transform is a new ...
Paul R. Hill, David R. Bull, Cedric Nishan Canagar...
The interrelationship between software faults and failures is quite intricate and obtaining a meaningful characterization of it would definitely help the testing community in decid...
Sigrid Eldh, Sasikumar Punnekkat, Hans Hansson, Pe...