951 search results - page 19 / 191 » On the Computation of Correctly-Rounded Sums |
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
HYBRID
2007
Springer
15 years 4 months ago
2007
Springer
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
102
click to vote
PODS
2005
ACM
15 years 10 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
76
Voted
UAI
2000
14 years 11 months ago
2000
Multi-agent games are becoming an increasingly prevalent formalism for the study of electronic commerceand auctions. The speed at which transactions can take place and the growing...
77
Voted
ANOR
2002
14 years 10 months ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...