Sciweavers

567 search results - page 88 / 114
» Reconstructing Numbers from Pairwise Function Values
Sort
View
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 3 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence veriļ¬cation of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
Namrata Shekhar, Priyank Kalla, Florian Enescu
TVLSI
2002
102views more  TVLSI 2002»
13 years 9 months ago
Low-power data forwarding for VLIW embedded architectures
In this paper, we propose a low-power approach to the design of embedded very long instruction word (VLIW) processor architectures based on the forwarding (or bypassing) hardware, ...
Mariagiovanna Sami, Donatella Sciuto, Cristina Sil...
TLCA
2009
Springer
14 years 4 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
ECML
2004
Springer
14 years 3 months ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agentā€™s policy is represented as a classiļ¬er mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 7 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick