Sciweavers

2695 search results - page 145 / 539
» The Complexity of Forecast Testing
Sort
View
ITC
1994
IEEE
111views Hardware» more  ITC 1994»
15 years 8 months ago
Simulation Results of an Efficient Defect-Analysis Procedure
For obtaining a zero defect level, a high fault coverage with respect to the stuck-at fault model is often not sufficient as there are many defects that show a more complex behavi...
Olaf Stern, Hans-Joachim Wunderlich
OPODIS
2007
15 years 5 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
ICML
2004
IEEE
16 years 5 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
ICSM
2002
IEEE
15 years 9 months ago
Maintaining Software with a Security Perspective
Testing for software security is a lengthy, complex and costly process. Currently, security testing is done using penetration analysis and formal verification of security kernels....
Kanta Jiwnani, Marvin V. Zelkowitz
ACL
1993
15 years 5 months ago
Principle-Based Parsing without Overgeneration
Overgeneration is the main source of computational complexity in previous principle-based parsers. This paper presents a message passing algorithm for principle-based parsing that...
Dekang Lin