951 search results - page 51 / 191 » On the Computation of Correctly-Rounded Sums |
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
DAGSTUHL
2007
15 years 1 days ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
EOR
2008
14 years 10 months ago
2008
In this paper we prove the existence and uniqueness of a solution concept for n-person games with fuzzy coalitions, which we call the Shapley mapping. The Shapley mapping, when it...
TNN
2008
14 years 10 months ago
2008
In classical training methods for node open fault, we need to consider many potential faulty networks. When the multinode fault situation is considered, the space of potential faul...