Sciweavers

2060 search results - page 56 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
ITP
2010
230views Mathematics» more  ITP 2010»
14 years 11 months ago
On the Formalization of the Lebesgue Integration Theory in HOL
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations o...
Tarek Mhamdi, Osman Hasan, Sofiène Tahar
TSE
1998
93views more  TSE 1998»
14 years 9 months ago
Xception: A Technique for the Experimental Evaluation of Dependability in Modern Computers
An important step in the development of dependable systems is the validation of their fault tolerance properties. Fault injection has been widely used for this purpose, however wi...
Joao Carreira, Henrique Madeira, João Gabri...
ALT
2008
Springer
15 years 6 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
LPNMR
2009
Springer
15 years 4 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
SASP
2008
IEEE
162views Hardware» more  SASP 2008»
15 years 4 months ago
Accelerating Compute-Intensive Applications with GPUs and FPGAs
—Accelerators are special purpose processors designed to speed up compute-intensive sections of applications. Two extreme endpoints in the spectrum of possible accelerators are F...
Shuai Che, Jie Li, Jeremy W. Sheaffer, Kevin Skadr...