• No results found

two-path tree search algorithm

A Tabu Search Algorithm for the Steiner Tree Problem.

A Tabu Search Algorithm for the Steiner Tree Problem.

... tabu search: The tabu search algorithm itself maybe modified with respect to the values of the selected parameters like tabu tenure and iterations before ...current algorithm, diversification ...

61

Prediction Distortion in Monte Carlo Tree Search and an Improved Algorithm

Prediction Distortion in Monte Carlo Tree Search and an Improved Algorithm

... the search tree in MCTS is a subset of the entire state ...the search tree, therefore potentially causing prediction distortion as learned in the RPS ...the path through A deceptively ...

34

A Novel Approach for Automated Test Path Generation using TABU Search Algorithm

A Novel Approach for Automated Test Path Generation using TABU Search Algorithm

... First Algorithm (DFS) for automated ...only two exit edges; evidently, these assumptions limit the applicable scope of the proposed ...basic path defined, basic paths, can be found by the DFS ...

7

The Longest ( st )-paths of C-shaped Supergrid Graphs

The Longest ( st )-paths of C-shaped Supergrid Graphs

... Hamiltonian path (cycle) in a graph is a simple path (cycle) in which each vertex of the graph appears exactly ...Hamiltonian path (cycle) problem involves deciding whether or not a graph contains a ...

7

Monte Carlo Tree Search and Its Applications

Monte Carlo Tree Search and Its Applications

... The researchers decided they needed a function which con- siders both believability and goal completion in its evalua- tion of a narrative [5]. These two measures are essential for making a quality narrative. A ...

7

Shortest Path Problem by Minimal Spanning Tree Algorithm using Bipolar
Neutrosophic Numbers

Shortest Path Problem by Minimal Spanning Tree Algorithm using Bipolar Neutrosophic Numbers

... Definition 2.5 [8]. In order to make a comparisons between two BNNs, the score function is applied to compare the grades of BNNs. This function shows that greater is the value, the greater is the Bipolar ...

9

The Hamiltonicity and Hamiltonian Connectivity of -shaped Supergrid Graphs

The Hamiltonicity and Hamiltonian Connectivity of -shaped Supergrid Graphs

... Hamiltonian path (cycle) and Hamiltonian connected problems on grid, triangular grid, and supergrid graphs have received much ...Hamiltonian path problem on grid graphs is ...Hamiltonian path between ...

6

SmartPATH: An Efficient Hybrid. ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots

SmartPATH: An Efficient Hybrid. ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots

... of path planning problem, these two techniques suffer from some ...local search capability and faster convergence speed but the algorithm can easily sink into a local optimum if the size of ...

15

Heuristic Based Backtracking for Propositional Satisfiability

Heuristic Based Backtracking for Propositional Satisfiability

... subsequent search of Figure 1, for both chronological (CB) and non-chronological backtracking ...The search path that leads to the solution is marked with letter ...the search backtracks ...

15

Tuning of cuckoo search based strategy for 
		t way testing

Tuning of cuckoo search based strategy for t way testing

... Cuckoo Search Strategy (CSS) is the newly developed strategy based on the Cuckoo Search ...Cuckoo Search Algorithm needs to be tuned namely the nest size, the elitism probability, and the ...

6

Learning to Bootstrap for Entity Set Expansion

Learning to Bootstrap for Entity Set Expansion

... above two problems, this pa- per enhances the bootstrapping system using the Monte Carlo Tree Search (MCTS) algorithm for lookahead search, combined with a pattern mover similarity ...

10

Comparative genomics: multiple genome rearrangement and efficient algorithm development

Comparative genomics: multiple genome rearrangement and efficient algorithm development

... We have discussed multiple genome rearrangement by signed reversal and developed several approximation algorithms: the nearest path search algorithm, the branch-andbound algorithm, the n[r] ...

96

BahaBa: A Route Generator System for Mobile Devices

BahaBa: A Route Generator System for Mobile Devices

... The work of Dale, et al. (2003) was one of the early works who used Natural Language Genera- tion (NLG) to provide navigational assistance. Their work, Coral, generate descriptions for routes from an area to another ...

6

A Linear Delay Algorithm for Enumerating All Connected Induced Subgraphs

A Linear Delay Algorithm for Enumerating All Connected Induced Subgraphs

... In section 3.4, we show how to separate the invalid candadites of a subgraph in the enumer- ation tree into a separate array. We measure the effectiveness of this step by enumerating the con- nected induced ...

45

Solving shortest path problem using gravitational search algorithm and neural networks

Solving shortest path problem using gravitational search algorithm and neural networks

... On the other hand existing shortest path algorithms such as Dijkstra [2], Moore build the optimal path based on the node they reach. However, in the case of considering the network consisting of several ...

19

Node Based Parallel Game Tree Search Algorithm Using Accelerated GPU

Node Based Parallel Game Tree Search Algorithm Using Accelerated GPU

... using tree based approach consist of drawbacks like searching is done using DFS manner, it requires more time for ...a tree-based approach many choices of games are computed serially by processor in DFS ...

8

Design of Counting Step Algorithm for Smartphone Based Indoor Localization

Design of Counting Step Algorithm for Smartphone Based Indoor Localization

... In this paper, we proposed a step detection scheme based on peak detection. The key technology of the scheme are the scoring algorithm and the adaptive window length algorithm. We use our proposed method to ...

7

Vehicle routing problem using colony and Markov algorithm

Vehicle routing problem using colony and Markov algorithm

... Markov algorithm method integrating the initial colony algorithm to study the VRPSPDP ...proposed algorithm is superior to these three algorithms in terms of total travel cost and average loading ...

5

Cuckoo Search Algorithm and BF Tree Used for Anomaly Detection in Data Mining

Cuckoo Search Algorithm and BF Tree Used for Anomaly Detection in Data Mining

... Abstract — Anomaly detection is the new research topic of this new generation of researcher’s today. Defect detection is a domain, that is, the key towards impending data mining. The term mining model refers towards ...

8

One Rank Cuckoo Search Algorithm with Application to Algorithmic Trading Systems Optimization

One Rank Cuckoo Search Algorithm with Application to Algorithmic Trading Systems Optimization

... an algorithm works in a mechanical manner, without any randomness, it is called ...the algorithm, it is called stochastic, as in genetic algorithms (GA) [1] and particle swarm optimization (PSO) algorithms ...

8

Show all 10000 documents...

Related subjects