matching

(redirected from Matching problem)
Also found in: Dictionary, Thesaurus, Medical, Legal, Encyclopedia.
Related to Matching problem: Maximum weight matching

Cash Flow Matching

The practice of matching returns on a portfolio to future capital outlays. That is, cash flow matching involves investing in certain securities with a certain expected return so that the investor will be able to pay for future liabilities. Pension funds and annuities perform the most cash flow matching, as they have future liabilities that are both large and relatively easy to estimate. Portfolios that perform cash flow matching usually invest in low-risk, investment-grade securities. The practice is also called portfolio dedication, matching, or the structured portfolio strategy.

matching

matching

the process of matching revenues and profits with the associated expenses incurred in earning these revenues. See ACCRUALS PRINCIPLE OF ACCOUNTING.
References in periodicals archive ?
The [delta][gamma]-order-preserving matching problem is to calculate the set of all indices i, 0 [less than or equal to] i [less than or equal to] n - m, satisfying the condition [mathematical expression not reproducible].
(2015) Efficient Algorithms for the Order Preserving Pattern Matching Problem. arXiv:1501.04001.
A few particular cases of the permutation pattern matching problem have been attacked successfully.
Consistency maintenance results in matching problems that some of which are at schema levels and some are at data levels (Devogele, Parent, and Spaccapietra 1998).
Let L denote the set of undirected links and w' the corresponding set of weights, the scheduling problem (18) is then equivalent to the maximum weighted matching problem on the weighted graph G' = (N, L', W').
[22] Abdulwahab Ali Al-mazroi and Nur'Aini Abdul Rashid, A Fast Hybrid Algorithm for the Exact String Matching Problem, American J.
The weight of the edge h(x, x) is employed to translate the proposed problem to a maximum weighted triple matching problem. It concerns how to assign weight to the edges of [G.sub.3m] such that the sum of the weighted edge is maximized.
Experimental results on two classical intractable problems, the point set matching problem and TSP, show that the GPU implementation of membrane algorithms is effective and efficient.
We begin by reviewing the famous matching problem, since its result will prove useful in the harder problem we will subsequently consider.
We call the fact that a mix of proficiency level is desired and learning styles should be considered for optimal knowledge exchange, but actually friendship and similar proficiency levels are matched the Peer Matching Problem.