723 search results - page 42 / 145 » Reducing the complexity of the issue logic |
IBMRD
2006
13 years 7 months ago
2006
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and nu...
CADE
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
DCC
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
ADHOCNETS
2010
Springer
13 years 5 months ago
2010
Springer
Event detection is a central component in numerous wireless sensor network (WSN) applications. In spite of this, the area of event description has not received enough attention. Th...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
FPGA application developers often attempt to use pipelining, Cslowing and retiming to improve the performance of their designs. Unfortunately, such registered netlists present a f...