Axon pruning is widely used for the refinement of neural circuits in both vertebrates and invertebrates, and may also contribute to the pathogenesis of neurodegenerative diseases. However, little is known about the cellular and molecular mechanisms of axon pruning. We use the stereotyped pruning of gamma neurons of the Drosophila mushroom bodies (MB) during metamorphosis to investigate these me...

Pruning a decision tree is considered by some researchers to be the most important part of tree building in noisy domains. While, there are many approaches to pruning, an alternative approach of averaging over decision trees has not received as much attention. We perform an empirical comparison of pruning with the approach of averaging over decision trees. For this comparison we use a computa-t...

Many of the pruning strategies used to remove less likely hypotheses from the search beam in large vocabulary speech recognition (LVR) systems, have a peak search space many times greater than the average search space. This paper discusses two such pruning strategies used within BT’s speech recognition architecture [1], Step pruning and Histogram pruning. Two-tier pruning is proposed as a simpl...

Radial Basis Function Neural Networks are well suited for learning the system dynamics of a robot manipulator and implementation of these networks in the control scheme for a manipulator is a good way to deal with the system uncertainties and modeling errors which often occur. The problem with RBF networks however is to find a network with suitable size, not too computational demanding and able...

Abstract A field experiment was carried out in one of the orchards Al-Qassim district Babel Governorate to find ability a locally manufactured platform serve palm trees by working flat and uneven orchard land, tree heights 4, 8, 12 meters, it performs pollination, pruning harvesting services. The time ascent descent, service, palm/hour productivity were measured. randomized complete block desig...

The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prove a sufficient condition that enables pruning and describe two pruning algorithms, αβ∗ and αβ∗ 1p. We prove correctness and optimality of the algorithms and provide an experimental study of their pruning power. We show...