2218 search results - page 13 / 444 » Testing Expressibility Is Hard |
JAIR
1998
14 years 9 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
ICCD
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper addresses the run-time diagnosis of delay faults in functional units of microprocessors. Despite the popularity of the stuck-at fault model, it is no longer the only re...
75
Voted
ISSTA
2006
ACM
2006
ACM
Architecture-driven platform independent deterministic replay for distributed hard real-time systems
15 years 3 months ago
Distributed hard real-time systems have become a major component of many advanced technical products. Means to ensure their proper quality are thus of paramount importance. To ens...
LCTRTS
1995
Springer
15 years 1 months ago
1995
Springer
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...