951 search results - page 47 / 191 » On the Computation of Correctly-Rounded Sums |
SUM
2009
Springer
15 years 3 months ago
2009
Springer
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
131
click to vote
ECCC
2011
14 years 5 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
WIOPT
2010
IEEE
2010
IEEE
Low complexity algorithms for relay selection and power control in interference-limited environments
14 years 9 months ago
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Source Code
"This Toolbox is designed to minimize the sum of coding, execution and analysis time for those who want to explore level set methods. Computationally, Matlab is not the fastes...
DCC
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from GF(2n) to GF(2), where n is the order of 2 mod p.