tree search algorithm
Parallelization of Node Based Game Tree Search Algorithm on GPU
... Game tree is the hierarchical tree structure begins at the initial position as a node and contains all possible moves from each ...Game tree Search algorithm is used to search ...
9
Node Based Parallel Game Tree Search Algorithm Using Accelerated GPU
... Game tree Search algorithm is used to search the best move in game ...game tree algorithm and propose a concise and general parallel game tree algorithm on ...
8
ACE: An Actor Ensemble Algorithm for Continuous Control with Tree Search
... ahead tree search with the multiple actors. The look-ahead tree search has achieved great success in various discrete ac- tion problems (Knuth and Moore 1975; Browne et ...look-ahead ...
8
Iterative Reconfigurable Tree Search Detection of MIMO Systems
... (tree) search algorithm has been employed in channel decoders [14, ...the search process in the previously mentioned ITS algorithm, the number of branches is decreased by ex- ploring ...
8
ETS: An Error Tolerable System for Coreference Resolution
... The score of partition [AD][B][C] can be calculated by score([A][B][C ]) + pos(A, D) + neg(B, D) + neg(C, D). Since we can computer pos and neg score between any two mentions in advance, this problem can be efficiently ...
5
A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs
... Prim's algorithm separately for each connected component and/or connected components of the graph or to find the minimum spanning forest in heuristic and metaheuristic algorithm to solve SMT ...Prim's ...
6
Interactive Visualization and Manipulation of Attention based Neural Machine Translation
... beam search and at- tention mechanism in an interactive way, by visu- alizing search tree and attention, expanding search tree manually, and changing attention weight ei- ther manually ...
6
A Tabu Search Algorithm for the Steiner Tree Problem.
... The pilot strategy proposed by Cees Duin and Stefan Voss [2] is a meta heuristic approach which can be applied for solving the steiner tree problem. This meta-heuristic has been proposed by the authors to enable, ...
61
METAHEURISTIC APPROACHES FOR THE QUADRATIC MINIMUM SPANNING TREE PROBLEM
... spanning tree was ...genetic algorithm which employed a decoder-based redundant encod- ing ...genetic algorithm using the Prüfer number ...tabu search tech- nique to solve the ...their ...
12
Service Networks Topological Design
... Partitioning algorithm (BPA) is a core sub-algorithm for solutions of many problems dealing with configuration/topological design of networks and other clustering ...
5
Branch and bound algorithms for the maximum clique problem under a unified framework
... of search tree nodes and the overall execution time for the basic algorithm confronted with the same values for executions of cp on the selected DI- MACS ...of search tree nodes with ...
15
A Survey on Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data
... Fine-grained Search, Scalability, Efficiency, Index privacy, Query Privacy, Result ranking, Index confidentiality, Query confidentiality, Query Unlink ability, semantic security and Trapdoor Unlink ...keyword ...
6
Image-based Search and Retrieval for Biface Artefacts using Features Capturing Archaeologically Significant Characteristics
... Image Search and Markup (DADAISM) project [12] is aimed at developing advanced computing technology, including image process- ing, to provide more useful and usable interactive systems for archaeologists to work ...
19
Branch and Bound Algorithm for Dependency Parsing with Non local Features
... Smith and Eisner modeled dependency parsing using Markov Random Fields (MRFs) with glob- al constraints and applied loopy belief propaga- tion (LBP) for approximate learning and inference (Smith and Eisner, 2008). ...
12
Diamond Search Improvement For Motion Estimation In High Efficiency Video Coding
... searching algorithm in motion estimation and motion compensation is an important manner in video coding techniques ...Diamond-search algorithm is presented and tested in this work to decrease the ...
6
Performance Evaluation of an Improved Model for Keyphrase Extraction in Documents
... Existing works on keyphrase extraction have been based mostly on supervised approaches. Reference [7] tried to improve on the work of [8], which is concerned with automatic extraction of keywords from abstracts using a ...
11
Title: AN UNSUBSTANTIATED URL-BASED MESH TAXONOMY SYSTEM
... trinity search and additionally we propose a decision tree algorithm for improving the better performance and enhance efficiency then it also extracts exact web ...
6
A unifying theory and improvements for existing approaches to text compression
... An algorithm is given which uses a binary search tree to fmd the longest string match, and experiments show that this results in a dramatic increase in encoding speed.... "There is nothi[r] ...
152
DISTRIBUTED NEAREST NEIGHBOR MATCHING ALGORITHM FOR COMPUTER VISION
... neighbor search problem can be defined as follows: given a set of points P = {p1, ...priority search k-means tree, R-forest, SCF, K-flat and degree-reduced k-nearest neighbor (k-DR) ...the ...
8
Semantics and OWL in UDDI Registry: Improving the Discovery Process of Web Services
... the algorithm is divided in three phases, in order to diferenciate the resulting services according to the “matching degree” with the client ...the algorithm, where the priority of the resultant services ...
6