RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB) and partial order dynamic backtracking (PDB) have been presented. These algorithms have the property to be additive on disjoint subproblems and yet use only polynomial space. Unlike DBFPDB only imposes a partial search order and therefore appears to have more freedom than DB to explore the search space. HoweverFboth algorithms ...

: Distributed generation (DG) sources are becoming more important in electrical networks due to the increase of energy demands. However, DG can have a profound effect on network power loss. Hence, optimal placement and size DGs extremely important. This study presents backtracking search algorithm (BSA) based multiple within distribution systems so reduce The BSA is new heuristic algorithm. Two...

Hydrocephalus is a neurological disease which causes ventricular dilation due to abnormalities in the cerebrospinal fluid (CSF) circulation. Although treatment via a CSF shunt in the brain ventricles has been performed, poor rates of patient responses continue. Thus, to aid surgeons in hydrocephalus treatment planning, we propose a geometric computational approach for tracking hydrocephalus ven...

Nogood recording is a known technique for pruning the search tree in backtracking search. Unfortunately, unrestricted nogood recording carries an overhead which has lead to the development of restricted forms of it. In this paper, we show how recent developments in the SAT literature can be applied in CSPs to facilitate unrestricted nogood recording. This in turn allows us to effectively use re...

Many problems of practical interest can be solved using tree search methods because carefully tuned successor ordering heuristics guide the search toward regions of the space that are likely to contain solutions. For some problems, the heuristics often lead directly to a solution| but not always. Limited discrepancy search addresses the problem of what to do when the heuristics fail. Our intuit...

A constant challenge of current spatial information systems i s the retrieval of spatial configurations. This paper describes a new approach to retrieving spatial information whose novelty lies in using a content measure of topological relations to search and index spatial configurations. This approach uses a tree-based schema to index relations between objects’ minimum bounding rectangles, it ...