Sciweavers

1810 search results - page 291 / 362
» BASE: Using Abstraction to Improve Fault Tolerance
Sort
View
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
15 years 3 months ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
JUCS
2007
98views more  JUCS 2007»
14 years 9 months ago
Focus of Attention in Reinforcement Learning
Abstract: Classification-based reinforcement learning (RL) methods have recently been proposed as an alternative to the traditional value-function based methods. These methods use...
Lihong Li, Vadim Bulitko, Russell Greiner
ICCAD
1996
IEEE
141views Hardware» more  ICCAD 1996»
15 years 1 months ago
An observability-based code coverage metric for functional simulation
Functional simulation is the most widely used method for design verification. At various levels of abstraction, e.g., behavioral, register-transfer level and gate level, the design...
Srinivas Devadas, Abhijit Ghosh, Kurt Keutzer
CLEF
2009
Springer
14 years 11 months ago
CLEF 2009 Ad Hoc Track Overview: Robust-WSD Task
Abstract. The Robust-WSD at CLEF 2009 aims at exploring the contribution of Word Sense Disambiguation to monolingual and multilingual Information Retrieval. The organizers of the t...
Eneko Agirre, Giorgio Maria Di Nunzio, Thomas Mand...
CADE
2006
Springer
15 years 10 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman