This paper describes a new algorithm called Bi-Directional Monte Carlo Tree Search. The essential idea of Bi-directional Search is to run an MCTS forwards from the start state, and simultaneously backwards goal stop when two searches meet. tested on 8-Puzzle Pancakes Problem, single-agent search problems, which allow control over optimal solution length d average branching factor b respectively...

Space savings is a demand of these days. Almost all applications are trying to represent their data in the least possible amount of space. It is the goal of all algorithms to consume as less memory as possible in the computer. Many techniques have been developed to compress large bulk of data so that large amount of information can be accommodated in lesser amount of space. The proposed approac...

urban green space is a fundamental and attractive element of cities around the world all through the year. selecting species resistant to dryness is an essential decision for planting them in the urban green space in arid and semi-arid regions. one of the most important experiments to introduce new plants in new regions is phenology of different species. in this study, the phonological characte...

We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitrary memory management system. We obtain the mean of each type of node, as well as the entire covariance matrix between types, whereupon weak laws of large numbers follow from the orders of magnitude (the norming consta...

Fractal coding of digital images o ers many promising qualities. The encoding process, however, su ers from the long search time of the domain block pool. A standard technique for speeding up the encoding is the feature classi cation of blocks. In this paper we show that the classes can be arranged in a tree, and searched by a pruning algorithm developed and explained in a previous paper by the...

THE HYBRID DIGITAL TREE AND ITS APPLICATIONS TO GENOMIC SEQUENCE DATABASES By Qiang Xue This dissertation focuses on index structures, search algorithms, and applications for large string databases whose indexes cannot fit entirely in the main memory (RAM). String searching is a classic research topic that has received increasing attention in recent years, due to the rapid growth of digital tex...