10715 search results - page 36 / 2143 » From Tests to Proofs |
RTAS
2005
IEEE
14 years 1 months ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
ICSE
2010
IEEE-ACM
14 years 22 days ago
2010
IEEE-ACM
Though verification tools are finding industrial use, the utility of engineering optimizations that make them scalable and usable is not widely known. Despite the fact that seve...
ECCC
2008
13 years 8 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
MA
2010
Springer
13 years 6 months ago
2010
Springer
In this work we provide a new methodology for comparing regression functions m1 and m2 from two samples. Since apart from smoothness no other (parametric) assumptions are required...