precompute

(redirected from Precomputing)
Also found in: Financial.

precompute

(ˌpriːkəmˈpjuːt)
adj
(Banking & Finance) in which annual interest on a loan is computed in advance and either removed in advance from the total sum of the loan given or automatically built into monthly repayments
vb (tr)
1. (Banking & Finance) to compute in advance (annual interest on a loan) and either remove it in advance from the total sum of the loan given or automatically build it into monthly repayments
2. (Mathematics) (in maths) to compute or calculate in advance
Mentioned in ?
References in periodicals archive ?
In addition, precomputing all the shortest paths and storing them explicitly in a huge dependency matrix seems to be challenging in terms of space complexity.
m] and ignoring the cost of normalization and of precomputing the neural responses of the templates, the number of required operations to export the NR is given by
Performance analysis of quantization-based approximation algorithms for precomputing the supported QoS, Journal of Network and Computer Applications, Vol.
This directly addresses the goal of the game of poker, which is to maximize the expected winnings against an initially unknown group of adversaries, but historically has been a more challenging problem than precomputing a robust nonadaptive agent.
Since we know that windows are important contributors to illumination, we can turn them into secondary light sources, precomputing and smoothing their output distributions for efficient rendering.
2]m/2 (by precomputing the answers stored within O(log log m) bits for any input input - a small block and a integer less than ([log.
We conclude that if no additional memory is used for precomputing the entries of the matrix B, the Gaussian window function in conjunction with the flag FG_PSI performs best; cf.
Instead of precomputing the transitions from a whole column to the next, the transitions from a region to the next region in the column were precomputed, although the current region could now depend on three previous regions (see Figure 16).
Precomputing the filters (represented as boolean vectors of length h) for all type constants requires O(h) calls to reachability in H (viewed as a graph) and hence is O([h.
This cost can be reduced somewhat by, for each term, precomputing the [W.