18 search results - page 1 / 4 » Architecture support for disciplined approximate programming |
ASPLOS
2012
ACM
12 years 23 days ago
2012
ACM
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
JSA
2008
13 years 5 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
PODC
2009
ACM
14 years 2 months ago
2009
ACM
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...