We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as a-0 pruning provides over minimax.

The representation of vector data at variable scales has been widely applied in geographic information systems and map-based services. When the scale changes across a wide range, a complex generalization that involves multiple operations is required to transform the data. To present such complex generalization, we proposed a matrix model to combine different generalization operations into an in...

Winter vineyard pruning is mainly manual (Schillaci et al., 2009), with the use of traditional secateurs. During pruning cuts follow on from one another in rapid succession and with a certain regularity and hence this operation characterised by high frequency and a stereotypic load on the upper limbs can in time cause WMSDs, (Work related Muscular Skeletal Disorders). The aim of the work was to...

Nonlinear impairments caused by devices and fiber transmission links in a coherent optical communication system can severely limit its distance achievable capacity. In this paper, we propose low-complexity pruned-convolutional-neural-network-(CNN)-based nonlinear equalizer, to compensate signal for systems. By increasing the size of effective receptive field with an 11 × large convolutional ker...

In this paper, pruned bit-reversal permutations employed in variable-length interleavers and their associated fast pruning algorithms and architectures are considered. Pruning permutations is mathematically formulated as a counting problem in a set of k integers and any subset of α consecutive integers under some permutation, where integers from this subset that map into indices less than some ...

Prism is a modular classification rule generation method based on the ‘separate and conquer’ approach that is alternative to the rule induction approach using decision trees also known as ‘divide and conquer’. Prism often achieves a similar level of classification accuracy compared with decision trees, but tends to produce a more compact noise tolerant set of classification rules. As with other...

Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers statistics on moves, and it prunes moves statistically inferior to the best one [5]. This papers yields two new pruning techniques: Miai Pruning (MP) and Set Pruning (SP). In MP the second move of the random games is selected at ran...

Compilers for neural network learning algorithms can achieve near-optimal co-locality of data and processes and near-optimal balancing of load over processors for irregular problems. This is impossible for general programs, but restricting programs to that particular problem domain allows for the exploitation of domain-speci c properties: The operations performed by neural algorithms are broadc...

Effective pruning is essential for efficient iceberg cube computation. Previous studies have focused on exclusive pruning: regions of a search space that do not satisfy some condition are excluded from computation. In this paper we propose inclusive and anti-pruning. With inclusive pruning, necessary conditions that solutions must satisfy are identified and regions that can not be reached by su...