951 search results - page 92 / 191 » On the Computation of Correctly-Rounded Sums |
129
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
108
click to vote
ASAP
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper introduces PAPA: Packed Arithmetic on a Prefix Adder, a new approach to parallel prefix adder design that supports a wide variety of packed arithmetic computations, inc...
156
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...
118
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
131
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...