Sciweavers

3600 search results - page 29 / 720
» The settling-time reducibility ordering
Sort
View
PLDI
1996
ACM
13 years 11 months ago
A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...
Alexandre E. Eichenberger, Edward S. Davidson
ICCBR
2010
Springer
13 years 11 months ago
Reducing the Memory Footprint of Temporal Difference Learning over Finitely Many States by Using Case-Based Generalization
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
Matt Dilts, Héctor Muñoz-Avila
TCSV
2002
89views more  TCSV 2002»
13 years 7 months ago
Reducing energy dissipation of frame memory by adaptive bit-width compression
Abstract--In this paper, we propose a new architectural technique to reduce energy dissipation of frame memory through adaptive bitwith compression. Unlike related approaches, the ...
Vasily G. Moshnyaga
DAC
2004
ACM
14 years 8 months ago
Proxy-based task partitioning of watermarking algorithms for reducing energy consumption in mobile devices
Digital watermarking is a process that embeds an imperceptible signature or watermark in a digital file containing audio, image, text or video data. The watermark is later used to...
Arun Kejariwal, Sumit Gupta, Alexandru Nicolau, Ni...
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
14 years 8 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong