DFDP

AcronymDefinition
DFDPDecentralized Financing and Development Programme (est. 2000; Nepal)
DFDPDefense Facility Decommissioning Program
DFDPDrug-Free Detention Program
Copyright 1988-2018 AcronymFinder.com, All rights reserved.
References in periodicals archive ?
3(a) shows an example of the DFDP in which the two feature distances (i.e., Dist and tMax) are divided into four segmentations, respectively.
To reduce the time cost, we propose a virtual reference block (VRB) approach in which the DFDP is equally partitioned into some blocks called VRBs represented by red dash rectangles in Fig.
3(d), assume that DFDP is first partitioned into some blocks called parent blocks using the equal-width or equal-quantity approach.
the DFDP is partitioned into blocks according to a segmentation scheme; 2.
where NumA refers to the total number of the object pairs in the DFDP, NumB refers to the total number of the object pairs in the bounding blocks.
During the processing of DFDP, the nodes or links in some found path fail.
During the processing of DFDP, the topology beyond the found paths changes.
After the execution of DFDP (min{k, k*} paths have been used for routing), the nodes or links in some found path fail.
We compare our algorithm DFDP with the centralized algorithm in [6] (denoted by CA), the pseudodistributed algorithm in [19] (denoted by EA), and the distributed algorithm in [5] (denoted by DA).
We already know that the communication complexity of DFDP is O(N x min{k, k*}).
CA, EA, and DFDP find no more disjoint paths when k [greater than or equal to] 10.
EA and DFDP almost have the same performance as CA in this aspect.