Depth-first search ≈ Depth-first search
View article
Scalable Distributed Monte-Carlo Tree Search Open
Monte-Carlo Tree Search (MCTS) is remarkably successful in two-player games, but parallelizing MCTS has been notoriously difficult to scale well, especially in distributed environments. For a distributed parallel search, transposition-tabl…
View article
Adaptive Search Range for HEVC Motion Estimation Based on Depth Information Open
High Efficiency Video Coding achieves twofold coding efficiency improvement compared with its predecessor H.264/MPEG-4 Advanced Video Coding. However, it suffers from high computational complexity due to its quad-tree structure in motion e…
View article
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games Open
We study quantum algorithms on search trees of unknown structure, in a model\nwhere the tree can be discovered by local exploration. That is, we are given\nthe root of the tree and access to a black box which, given a vertex $v$,\noutputs …
View article
FPS: Fast Path Planner Algorithm Based on Sparse Visibility Graph and Bidirectional Breadth-First Search Open
The majority of planning algorithms used are based on the occupancy grid maps, but in complicated situations, the occupancy grid maps have a significant search overhead. This paper proposed a path planner based on the visibility graph (v-g…
View article
A work-efficient algorithm for parallel unordered depth-first search Open
International audience
View article
A Framework for Verifying Depth-First Search Algorithms Open
Many graph algorithms are based on depth-first search (DFS). The formalizations of such algorithms typically share many common ideas. In this paper, we summarize these ideas into a framework in Isabelle/HOL.Building on the Isabelle Refinem…
View article
Comparison Analysis of Breadth First Search and Depth Limited Search Algorithms in Sudoku Game Open
Sudoku is a game that sharpens the brain and is very well known. But the problem faced in this condition is how we can find a solution for the completion of this game. Problems with the Sudoku game can be solved by using the concept of Art…
View article
Research on C4.5 algorithm improvement strategy based on MapReduce Open
By analyzing the shortcomings of C4.5 decision tree algorithm, this paper combines MapReduce parallel model in Hadoop platform with C4.5 decision tree algorithm, so that C4.5 algorithm can be executed in parallel, so as to improve the effi…
View article
A hybrid search agent in pommerman Open
In this paper, we explore the possibility of search-based agents in games with resource-intensive forward models. We implemented a player agent in the Pommerman framework and put it against the baseline agent to measure its performance. We…
View article
Encoding Redundancy for Satisfaction-Driven Clause Learning Open
Satisfaction-Driven Clause Learning (SDCL) is a recent SAT solving paradigm that aggressively trims the search space of possible truth assignments. To determine if the SAT solver is currently exploring a dispensable part of the search spac…
View article
Machine Learning Guidance for Connection Tableaux Open
Connection calculi allow for very compact implementations of goal-directed proof search. We give an overview of our work related to connection tableaux calculi: first, we show optimised functional implementations of connection tableaux pro…
View article
Breadth First Search Approach for Shortest Path Solution in Cartesian Area Open
Determining the shortest path is one problem that is much discussed using some algorithm like Djikstra, Floyd Warshall and in this research an algorithm Breadth First Search are used, Breadth First Search algorithms in this study is used t…
View article
Breadth First Search Approach for Shortest Path Solution in Cartesian Area Open
Determining the shortest path is one problem that is much discussed using some algorithm like Djikstra, Floyd Warshall and in this research an algorithm Breadth First Search are used, Breadth First Search algorithms in this study is used t…
View article
Best Path in Mountain Environment based on Parallel Hill Climbing Algorithm Open
Heuristic search is a search process that uses domain knowledge in heuristic rules or procedures to direct the progress of a search algorithm. Hill climbing is a heuristic search technique for solving certain mathematical optimization prob…
View article
Automatic Move Pruning in General Single-Player Games Open
Move pruning is a low-overhead technique for reducing the size of a depth first search tree. The existing algorithm for automatically discovering move pruning information is restricted to games where all moves can be applied to every state…
View article
A Hybrid Intelligent Search Algorithm for Automatic Test Data Generation Open
The increasing complexity of large-scale real-world programs necessitates the automation of software testing. As a basic problem in software testing, the automation of path-wise test data generation is especially important, which is in ess…
View article
On the recognition of search trees generated by BFS and DFS Open
The spanning trees of a graph constructed by the graph searches BFS and DFS are some of the most elementary structures in algorithmic graph theory. BFS-trees are first-in trees, i.e., every vertex is connected to its first visited neighbor…
View article
Basis Path Testing of Iterative Deepening Search and Held-Karp on Pathfinding Algorithm Open
This research is a continuation of previous research, where in previous research discussed about the implementation of both methods. Implementation is done using visual basic programming language. Both methods are compared based on the res…
View article
Space-Efficient Fully Dynamic DFS in Undirected Graphs † Open
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in O ( n + m ) time for a graph with n vertices and m edges. We consider the dynamic DFS problem, that is, to maintain a DFS tree of an undirected grap…
View article
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs Open
The lexicographic depth-first search (Lex-DFS) is one of the first basic graph problems studied in the context of space-efficient algorithms. It is shown independently by Asano et al. [ISAAC 2014] and Elmasry et al. [STACS 2015] that Lex-D…
View article
Backtracking search optimization algorithm with dual scatter search strategy for automated test case generation Open
It is a challenge to design an effective algorithm utilizing problem features in automated test case generation for path coverage (ATCG-PC). A feature of ATCG-PC “similar paths are usually executed by similar test cases” was touched by a f…
View article
Delay Analysis of Multichannel Parallel Contention Tree Algorithms (MP-CTA) Open
Contention tree algorithm is initially invented as a solution to improve the stable throughput problem of Slotted ALOHA in multiple access schemes. Even though the throughput is stabilized in tree algorithms, the delay of requests may grow…
View article
An Optimization Strategy for CFDMiner: An Algorithm of Discovering Constant Conditional Functional Dependencies Open
Compared to the traditional functional dependency (FD), the extended conditional functional dependency (CFD) has shown greater potential for detecting and repairing inconsistent data. CFDMiner is a widely used algorithm for mining constant…
View article
A parallel framework for reverse search using mts Open
We describe mts, which is a generic framework for parallelizing certain types of tree search programs, that (a) provides a single common wrapper containing all of the parallelization, and (b) minimizes the changes needed to the existing si…
View article
Best-First Search for Bounded-Depth Trees Open
Tree search is a common technique for solving constraint satisfaction and combinatorial optimization problems. The most popular strategies are depth-first search and limited discrepancy search. Aside from pruning or ordering the children o…
View article
Crow Search Algorithm with Improved Objective Function for Test Case Generation and Optimization Open
Test case generation and optimization is the foremost requirement of software evolution and test automation. In this paper, a bio-inspired Crow Search Algorithm (CSA) is suggested with an improved objective function to fulfill this require…
View article
AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm Open
This paper presents a new anytime incremental search algorithm, AD*-Cut. AD*-Cut is based on two algorithms, namely, Anytime Repairing A* (ARA*) and the novel incremental search algorithm, D* Extra Lite. D* Extra Lite reinitializes (cuts) …
View article
Tree search algorithms for the Sequential Ordering Problem Open
We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algorithm. It consists of an iterative Beam Search algorithm tha…
View article
A Reactive Strategy for High-Level Consistency During Search Open
Constraint propagation during backtrack search significantly improves the performance of solving a Constraint Satisfaction Problem. While Generalized Arc Consistency (GAC) is the most popular level of propagation, higher-level consistencie…
View article
Sudoku solutions: a comparative analysis of breadth-first search, depth-first search, and human approaches Open
Sudoku is a puzzle that has a unique solution. No matter how many methods are used, the result will always be the same. The player thought that the number of givens or clues, the initial value on the Sudoku puzzles, would significantly det…