Sciweavers

162 search results - page 19 / 33
» Completeness Guarantees for Incomplete Reasoners
Sort
View
ANSS
2007
IEEE
15 years 4 months ago
Failure Prediction in Computational Grids
Accurate failure prediction in Grids is critical for reasoning about QoS guarantees such as job completion time and availability. Statistical methods can be used but they suffer f...
Woochul Kang, Andrew S. Grimshaw
CAV
2004
Springer
154views Hardware» more  CAV 2004»
15 years 1 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
15 years 10 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
LPNMR
2005
Springer
15 years 3 months ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub
DLOG
2011
14 years 1 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese