Sciweavers

24 search results - page 4 / 5
» Some 3CNF properties are hard to test
Sort
View
AAAI
2000
13 years 10 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
CF
2005
ACM
13 years 10 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
SIGMETRICS
2010
ACM
217views Hardware» more  SIGMETRICS 2010»
13 years 8 months ago
Optimal recovery of single disk failure in RDP code storage systems
Modern storage systems use thousands of inexpensive disks to meet the storage requirement of applications. To enhance the data availability, some form of redundancy is used. For e...
Liping Xiang, Yinlong Xu, John C. S. Lui, Qian Cha...
RAS
2000
119views more  RAS 2000»
13 years 8 months ago
Benchmarking cerebellar control
Cerebellar models have long been advocated as viable models for robot dynamics control. Building on an increasing insight in and knowledge of the biological cerebellum, many model...
P. Patrick van der Smagt
OOPSLA
2005
Springer
14 years 2 months ago
Relational queries over program traces
Instrumenting programs with code to monitor runtime behavior is a common technique for profiling and debugging. In practice, instrumentation is either inserted manually by progra...
Simon Goldsmith, Robert O'Callahan, Alexander Aike...