land cover is one of basic data layers in geographic information system for physical planning and environmentalmonitoring. digital image classification is generally performed to produce land cover maps from remote sensing data,particularly for large areas. in the present study the multispectral image from irs liss-iii image along with ancillary datasuch as vegetation indices, principal componen...

It is well known that maximum-likelihood (ML) decoding in many digital communication schemes reduces to solving an integer least-squares problem, which is NP hard in the worstcase. On the other hand, it has recently been shown that, over a wide range of dimensions and signal-to-noise ratios (SNRs), the sphere decoding algorithm can be used to find the exact ML solution with an expected complexi...

We consider random binary search trees when the input consists of a multiset, i.e. a set with multiple occurrences of equal elements, and prove that the randomized insertion and deletion algorithms produce random search trees regardless of multiplicities; even if all the elements are equal during the tree updates, a search tree will maintain its randomness. Thus, equal elements do not degenerat...

Sample-based tree search (SBTS) is an approach to solving Markov decision problems based on constructing a lookahead search tree using random samples from a generative model of the MDP. It encompasses Monte Carlo tree search (MCTS) algorithms like UCT as well as algorithms such as sparse sampling. SBTS is well-suited to solving MDPs with large state spaces due to the relative insensitivity of S...

We present YOPT a program that plays Hex using Monte-Carlo tree search. We describe heuristics that improve simulations and tree search. We also address the combination of Monte-Carlo tree search with virtual connection search.

With the advent of the internet and easy access to digital libraries, plagiarism has become a major issue. Applying search engines is one of the plagiarism detection techniques that converts plagiarism patterns to search queries. Generating suitable queries is the heart of this technique and existing methods suffer from lack of producing accurate queries, Precision and Speed of retrieved result...

This paper describes about hardware game tree search method of Blokus Duo. As algorithm of the game tree search method, we apply an evaluation function of sphere of influence. The game tree search method of hardware is implemented on FPGA. An implementation of the game tree search method by the hardware shows the effect which is easily of the operating speed improving.

We propose DSL, a new Scalable Distributed Data Structure for the dictionary problem, based on a version of Skip Lists, as an alternative to both random trees and deterministic height balanced trees. Our scheme exhibits, with high probability, logarithmic search time, constant reconstruction time, and linear space overhead. Additionally, at the expense of two additional pointers per internal no...