121 search results - page 12 / 25 » Optimizing polynomials for floating-point implementation |
WWW
2005
ACM
15 years 10 months ago
2005
ACM
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
TCOM
2010
14 years 8 months ago
2010
Abstract—We investigate routing in cooperative multipleterminal wireless networks in which the nodes can collaborate with each other in data transmission. First, we motivate coop...
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...