Sciweavers

951 search results - page 7 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
CSIE
2009
IEEE
14 years 4 months ago
A Computation Saving Partial-Sum-Global-Update Scheme for Perceptron Branch Predictor
With the pipeline deepen and issue width widen, the accuracy of branch predictor becomes more and more important to the performance of a microprocessor. State-of-theart researches...
Liqiang He
IJAR
2006
125views more  IJAR 2006»
13 years 9 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
COMPGEOM
1989
ACM
14 years 1 months ago
Computing Partial Sums in Multidimensional Arrays
d Abstract) Bernard Chazelle Burton Rosenberg Department of Computer Science Princeton University
Bernard Chazelle, Burton Rosenberg
CG
2006
Springer
14 years 1 months ago
Computing Proper Equilibria of Zero-Sum Games
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
Peter Bro Miltersen, Troels Bjerre Sørensen