963 search results - page 58 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
104
click to vote
CGO
2010
IEEE
15 years 6 months ago
2010
IEEE
Reducing the arithmetic precision of a computation has real performance implications, including increased speed, decreased power consumption, and a smaller memory footprint. For s...
129
click to vote
SPAA
1994
ACM
15 years 3 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
DAC
1999
ACM
15 years 4 months ago
1999
ACM
In this paper, we present a new method to the built-in selftestable data path synthesis based on integer linear programming (ILP). Our method performs system register assignment, ...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
SAC
2002
ACM
14 years 11 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...