Sciweavers

6568 search results - page 175 / 1314
» Reducing the Complexity of Reductions
Sort
View
ICNP
1998
IEEE
15 years 10 months ago
On Reducing the Processing Cost of On-Demand QoS Path Computation
Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network...
George Apostolopoulos, Satish K. Tripathi
DAC
2010
ACM
15 years 10 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler
ATAL
2006
Springer
15 years 10 months ago
Reducing price fluctuation in continuous double auctions through pricing policy and shout improvement
Auction mechanism design is a subfield of game theory dedicated to manipulating the rules of an auction so as to achieve specific goals. The complexity of the dynamics of auctions...
Jinzhong Niu, Kai Cai, Simon Parsons, Elizabeth Sk...
HPCA
1995
IEEE
15 years 10 months ago
Reducing Communication Latency with Path Multiplexing in Optically Interconnected Multiprocessor Systems
—Reducing communication latency, which is a performance bottleneck in optically interconnected multiprocessor systems, is of prominent importance. A conventional approach for est...
Chunming Qiao, Rami G. Melhem
CORR
2007
Springer
79views Education» more  CORR 2007»
15 years 6 months ago
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
Xuancheng Shao, Steven G. Johnson