176 search results - page 4 / 36 » Reducing the number of counters needed for integer multiplic... |
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
JSC
2011
12 years 10 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
RTCSA
2006
IEEE
14 years 1 months ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...