692 search results - page 11 / 139 » BDD minimization for approximate computing |
148
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
122
click to vote
COMPUTING
2010
15 years 1 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
129
Voted
CAGD
2010
15 years 3 months ago
2010
Many problems in computer aided geometric design and geometry processing are stated as least
132
Voted
TCS
2008
15 years 3 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
148
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...