The objective was to quantify the influence of thinning, high pruning and slash management on crop tree stand growth in young even-aged stands planted silver birch (Betula pendula Roth). This study based two field experiments, aged six eleven years at initiation re-measured after eight years, respectively. Treatments included unthinned control, moderate thinning mainly from below (removing 28–3...

Korf, R.E., Multi-player alpha-beta pruning (Research Note), Artificial Intelligence 48 (1991) 99-111. We consider the generalization of minimax search with alpha-beta pruning to non-cooperative, perfect-information games with more than two players. The minimax algorithm was generalized in [2] to the maxn algorithm applied to vectors of n-tuples representing the evaluations for each of the play...

We present two additions to the hierarchical mixture of experts (HME) architecture. By applying a likelihood splitting criteria to each expert in the HME we "grow" the tree adaptively during training. Secondly, by considering only the most probable path through the tree we may "prune" branches away, either temporarily, or permanently if they become redundant . We demonstrate results for the gro...

O(3)could reduce growth and carbohydrate allocation to roots by direct inhibition of photosynthesis and source strength. Alternatively, O(3) could reduce growth indirectly by inhibition of root hydraulic development through a primary lesion in carbohydrate translocation. Another alternative is that O(3) could slow the rate of plant development, only apparently altering carbohydrate allocation a...

This work improves the efficiency of dynamic pruning algorithms by introducing a new posting iterator that can skip large parts of the matching documents during top-k query processing. Namely, the conditional-skip iterator jumps to a target document while skipping all matching documents preceding the target that cannot belong to the final result list. We experiment with two implementations of t...

The default multilayer neural network topology is a fully interlayer connected one. This simplistic choice facilitates the design but it limits the performance of the resulting neural networks. The best-known methods for obtaining partially connected neural networks are the so called pruning methods which are used for optimizing both the size and the generalization capabilities of neural networ...

Dendritic spines undergo the processes of formation, maturation, and pruning during development. Molecular mechanisms controlling spine maturation and pruning remain largely unknown. The gene for brain-derived neurotrophic factor (BDNF) produces two pools of mRNA, with either a short or long 3' untranslated region (3' UTR). Our previous results show that short 3' UTR Bdnf mRNA is restricted to ...

|Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this empirical study. However, an open problem in the pruning methods known today (OBD, OBS, autoprune, epsiprune) is the selection of the number of parameters to be removed in each pruning step (pruning strength). This work presents a pruning method...

In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conventional versions of nullmove pruning use reduction values of R ≤ 3, we use an aggressive reduction value of R = 4 within a verified adaptive configuration which maximizes the benefit from the more aggressive pruning, while limi...