Sciweavers

146 search results - page 11 / 30
» Fault-Tolerant Distributed Theorem Proving
Sort
View
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
12 years 11 months ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 7 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
TIT
2002
68views more  TIT 2002»
13 years 7 months ago
A Lagrangian formulation of Zador's entropy-constrained quantization theorem
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
Robert M. Gray, Tamás Linder, Jia Li
ISW
2001
Springer
13 years 11 months ago
Suitability of a Classical Analysis Method for E-commerce Protocols
We present the adaptation of our model for the validation of key distribution and authentication protocols to address specific needs of protocols for electronic commerce. The two ...
Sigrid Gürgens, Javier Lopez
IJCAI
1997
13 years 8 months ago
High Performance ATP Systems by Combining Several AI Methods
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
Jörg Denzinger, Marc Fuchs, Matthias Fuchs