This paper proposes a method for the optimal placement of phasor measurement units (PMUs) complete observability power system based on degree neighbourhood vertices. A three-stage algorithm is used to determine minimum number PMUs needed make observable. The key objective proposed methodology minimize total completely observe network and thereby installation cost. In addition, technique also fo...

This paper presents a neighbor-search technique to be used in a GPU-based particle simulation framework. Neighbor searching is usually the most computationally expensive step in particle simulations. The usual approach is to subdivide the simulation space to speed up neighbor search. Here, we present a grid-based neighbor-search technique designed to work on programmable graphics hardware.

This paper investigates a global search optimisation technique, referred to as the repeated weighted boosting search. The proposed optimisation algorithm is extremely simple and easy to implement. Heuristic explanation is given for the global search capability of this technique. Comparison is made with the two better known and widely used global search techniques, known as the genetic algorithm...

It is often useful to know, in advance, how much effort will be required to solve a search problem. Current techniques for estimating the number of nodes that a bounded depth-first search will expand require copious amounts of off-line training and only make predictions in domains with integer-valued heuristic estimates. We present a new technique for estimating the number of nodes that a bound...

Multiplying the heuristic function by a weight greater than one is a well-known technique in Heuristic Search. When applied to A* with an admissible heuristic it yields substantial runtime savings, at the expense of sacrificing solution optimality. Only a few works have studied the applicability of this technique to Real-Time Heuristic Search (RTHS), a search approach that builds upon Heuristic...

The main aim of this paper is to present a framework for tabulated SLD-resolution that allows a strict separation between search space and search. We introduce the notion of a search forest to model the search space, and we deene what we understand by a search strategy for it. We present some basic search strategies and discuss how a particular tabulation technique, OLDT-resolution, and a parti...

This paper presents a technique for statistically characterizing a search space and demonstrates the use of this technique within a practical telescope scheduling application. The characterization provides the following: (i) an estimate of the search space size, (ii) scaling technique for multi-attribute objective functions and search heuristics, (iii) a "quality density function" for schedules...

When a query is submitted to a search engine, the search engine returns a dynamically generated result page that contains the number of hits (i.e., the number of matching results) for the query. Hit number is a very useful piece of information in many important applications such as obtaining document frequencies of terms, estimating the sizes of search engines and generating search engine summa...

Search engines have primarily focused on presenting the most relevant pages to the user quickly. A less well explored aspect of improving the search experience is to remove or group all near-duplicate documents in the results presented to the user. In this paper, we apply a Bloom filter based similarity detection technique to address this issue by refining the search results presented to the us...

In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important operations in search engines and numerous other applications. In this paper we propose a new text indexing technique for improving the performance of keyword search. Our proposed technique not only speeds up searching o...