Sciweavers

10715 search results - page 39 / 2143
» From Tests to Proofs
Sort
View
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 1 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
CCCG
2004
13 years 9 months ago
On corners of objects built from parallelepiped bricks
We investigate a question initiated in the work of Sibley and Wagon, who proved that 3 colors suffice to color any collection of 2D parallelograms glued edge-to-edge. Their proof ...
Mirela Damian, Joseph O'Rourke
RTSS
2003
IEEE
14 years 1 months ago
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
Theodore P. Baker
ISSTA
2006
ACM
14 years 1 months ago
A case study of automatically creating test suites from web application field data
Creating effective test cases is a difficult problem, especially for web applications. To comprehensively test a web application’s functionality, test cases must test complex a...
Sara Sprenkle, Emily Gibson, Sreedevi Sampath, Lor...
AML
2006
106views more  AML 2006»
13 years 8 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov