An eecient parallel algorithm FPM(Fast Parallel Mining) for mining association rules on a shared-nothing parallel system has been proposed. It adopts the count distribution approach and has incorporated two powerful candidate pruning techniques, i.e., distributed pruning and global pruning. It has a simple communication scheme which performs only one round of message exchange in each iteration....

Nearest neighbor queries on R-trees use a number of pruning techniques to improve the search. We examine three common 1-nearest neighbor pruning strategies and generalize them to k-nearest neighbors. This generalization clears up a number of prior misconceptions. Specifically, we show that the generalization of one pruning technique, referred to as strategy 2, is non-trivial and requires the in...

investigation of the interrelationships between yield and its components will improve the efficiency of a breeding program with appropriate selection criteria. in this study, the relationship among yield components and their direct and indirect influences on the total yield of melon were investigated. the study was based on evaluation of 49 entries gener-ated from a 7×7 diallel involving irania...

abstract in order to study the effect of planting density and branch pruning on growth, yield and quality of greenhouse muskmelon, a study has been conducted using a factorial experiment in a completely randomized design with three replications and three factors, including cultivar (galia-52 and mirella), branch pruning (1 and 2 branch per plant), and plant density (2, 2.4, 2.8 and 3.6 plants p...

The minimax algorithm, also called the negamax algorithm, remains today the most widely used search technique for two-player perfect-information games. However, minimaxing has been shown to be susceptible to game tree pathology, a paradoxical situation in which the accuracy of the search can decrease as the height of the tree increases. Althöfer’s alternative minimax algorithm has been proven t...