An online graph search approach based on an improved Node Counting is presented for the complete terrain coverage motion planning of mobile robots.

A Discussion on Fill in Blanks Method to Teach Binary Tree Traversal;

The Implementation of Traversal Table by Class in VFP——Analysis and Design;

A research and application of FTP file traversal method;

Build and Traverse of Abstract Syntax Tree Based on Java Program;

For algorithm complexity and trav- erse efficiency problems of a majority of intelligent cleaner traverse dust absorption,a mode of relative positioning by objects of reference to make certain relative position of intelligent cleaner in the room is proposed.

With the algorithm we can obtain three sequences but need only one time to traverse the binary tree.

The Recursive and Non-recursive Algorithm of Post-traversing Binary Tree;

The Algorithm of InOrder-traversing BinaryTree;

The Recursive And Non-recursive Algorithm of Post-traversing Binary Tree;

Analyzing the Ergodicity of Aperiodic Markov Chain by C language;

Recurrent,ergodicity properties for an extended birth-death minimal Q-process;

In the end,a special experiment is implemented according to actual applications,using pseudorandom code ergodicity instead of related dispreading in se.

Some Generalizations of a Classical Ergodic Property for IFS;

A survey of ergodicity on the set-valued mappings;

Two specific single birth Q-matrices were examined,criteria for ergodicity and strong ergodicity were obtained,necessary and sufficient conditions for exponential ergodicity were presented.