Incremental rule-extraction algorithm based on variable precision rough set and search tree;

A Routing Lookup Algorithm Based on Fast Search Trees;

The proposed algorithm raises the efficiency of ergodic search trees and speeds up pruning.

An algorithm on solving 24-point game based on AI searching tree is constructed in this paper.

Shortest Path Search is one of core technologies of game based on directx,this paper analyzes the common search method:breadth_first,depth_first and heuristic_Search,finally presents the a Star algorithm using searching tree to realize a shortest path finder in big size map with complicated obstacle.

First, the selection principle for the fuzzy wodel s number of input variables is analyzed by making use of the searching tree.

Presents a new classification algorithm called RC FST (Rules Cuttings Fast Search Trees) which splits the set of filter rules into several subsets by the Hash compression index table built based on the first 8bit prefix of IP and constructs fast search trees for each subset.

For conventional Gaussian approximation(GA) detection,tree-search method is used and only part of transmit symbol combinations contributing significantly to posterior probabilities are retained,having a complexity linear with retained branches number.

The Ant-Q algorithm can effectively implement this kind of tree search,and then the optimal solution of the rectangular part optimal layout will be obtained.

To implement this kind of tree search using ant colony system algorithm, a number of artifical ants are distributed on the root of the AND/OR tree and communicate with one another through the phenomenon trails.

To im-plement this kind of tree search using ant colony system algorithm,a number of artificial ants are distributed on the root of the AND/OR tree and communicate with one another through the pheromone trails which are a form of the long-term memory guiding the futu.