ENHANCED REALIZATION PROBABILITY SEARCH
نویسندگان
چکیده
منابع مشابه
Game-tree Search Algorithm based on Realization Probability
In games like chess, the node-expansion strategy significantly affects the performance of a gameplaying program. In this article we propose a new game-tree search algorithm that uses the realization probabilities of nodes for deciding upon the range of the search. The realization probability of a node represents the probability that the moves leading to the node will actually be played. Our alg...
متن کاملB* Probability Based Search
We describe a search algorithm for two-player games that relies on selectivity rather than brute-force to achieve success. The key ideas behind the algorithm are: 1. Stopping when one alternative is clearly better than all the others, and 2. Focusing the search on the place where the most progress can likely be made toward stopping. Critical to this process is identifying uncertainty about the ...
متن کاملRealization of Ontology Web Search Engine
This paper describes the realization of the Ontology Web Search Engine. The Ontology Web Search Engine is realizable as independent project and as a part of other projects. The main purpose of this paper is to present the Ontology Web Search Engine realization details as the part of the Semantic Web Expert System and to present the results of the Ontology Web Search Engine functioning. It is ex...
متن کاملProbability-based robot search paths
The aim of this work is to show that robots can be improved using knowledge present or gained in previous executions of the task. Here, this knowledge is used to create search paths tailored to the problem at hand. We describe two approaches to create such paths automatically which enable robots to find an unknown position faster than standard paths. The solution presented here is not limited t...
متن کاملGenetic search over probability spaces
This paper proposes two new crossover operators for searching over discrete probability spaces. The design of the operators is considered in the light of recent theoretical insights into genetic search provided by forma analysis. A nontrivial test problem in enforcing coherency of probability estimates in cross-impact analysis highlights the utility of the designed operators. The presented oper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Mathematics and Natural Computation
سال: 2008
ISSN: 1793-0057,1793-7027
DOI: 10.1142/s1793005708001070