6110 search results - page 144 / 1222 » Approximate Computing |
156
click to vote
BIRTHDAY
2005
Springer
15 years 12 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
182
click to vote
TEC
2002
15 years 6 months ago
2002
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
160
click to vote
BIOSYSTEMS
2008
15 years 6 months ago
2008
Telomere shortening provides a molecular basis for the Hayflick limit. Recent data suggest that telomere shortening also influence mitotic rate. We propose a stochastic growth mod...
160
click to vote
TSP
2010
15 years 1 months ago
2010
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
158
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
Approximate reachability techniques trade o accuracy for the capacity to deal with bigger designs. Cho et al 4 proposed partitioning the set of state bits into mutually disjoint s...