• No results found

best-first heuristic search

Best-first heuristic search for multicore machines

Best-first heuristic search for multicore machines

... during search is to access the closed list less ...memory search, can be used to temporarily delay access to the a closed ...the best version being kept and inserted onto the open ...frontier ...

56

A Study On Best First Search

A Study On Best First Search

... This search space differs from those where best- first typically applied, because a solution search list is evaluated by its maximum cost instead of the sum of its users searching data ...make ...

10

Best First Heuristic Pruning Function for General Flow Shop Scheduling Problem

Best First Heuristic Pruning Function for General Flow Shop Scheduling Problem

... primarily, best-first heuristic search with hill-climbing search implementation method has been expanded for general m-machine flow-shop scheduling problem, after that, a new pruning ...

11

Download
			
			
				Download PDF

Download Download PDF

... depth first search (DFS), breadth first search (BFS), best first search, hill-climbing and A* algorithm, in solving problem instances of the 8-Puzzle, Towers of Hanoi and ...

13

A New Heuristic in Mutual Sequential Mate Search

A New Heuristic in Mutual Sequential Mate Search

... or search strategies in the Todd and Miller’s (1999) human mate choice model are more successful than the others, and given our answer to this question we have proposed a new heuristic that is in terms of ...

24

Vol 15, No 6 (2015)

Vol 15, No 6 (2015)

... the heuristic value is not guaranteed to be optimal, it can also search for the shortest ...* search algorithm can be used to achieve the same speed as greedy best-first search ...

13

Anytime Recursive Best-First Search for Bounding Marginal MAP

Anytime Recursive Best-First Search for Bounding Marginal MAP

... of best-first and depth-first AND/OR search in order to facilitate the generation of upper bounds (via the best-first component) alongside lower bounds (via the ...

9

Scheduling In Cloud Based On Hyper Heuristics

Scheduling In Cloud Based On Hyper Heuristics

... This heuristic scheduling mainly involves the following steps. First the parameters are set up, such as the maximum size of the population and the maximum number of ...a heuristic algorithm from the ...

6

A Survey of Travelling Salesman Problem Using Heuristic Search Techniques

A Survey of Travelling Salesman Problem Using Heuristic Search Techniques

... solutions. Heuristic Search Techniques would help in such cases to obtain a near-optimal solution within reasonable time and better ...the Heuristic Search ...Depth-first search, ...

5

Path finding algorithms in game engine development

Path finding algorithms in game engine development

... the best route that goes through that node (Koenig et ...this heuristic estimate. The A* algorithm is therefore an example of best-first ...

17

The Effect of Best First Search Optimization on Credit Card Fraudulent Transaction Detection

The Effect of Best First Search Optimization on Credit Card Fraudulent Transaction Detection

... Best-first search in its most common form is a simple heuristic search ...graph-based search algorithm is a Best-first search (Dechter and Pearl, 1985), ...

8

View pdf

View pdf

... keyword search in relational ...can search for road networks [3, 8, 9, 14, 15, 16, 20, ...heavy search over head g, which has very poor scalability and efficiency of large road ...linear ...

5

Planning For Non-Player Characters By Learning From Demonstration

Planning For Non-Player Characters By Learning From Demonstration

... We invited participants to play a simple video game of our design. The game presents a 2D environment to the player. The goal of the game is to navigate the player’s character through the environment to reach a goal ...

141

Boozy Categorizing Search Engine for Best Search

Boozy Categorizing Search Engine for Best Search

... simple search engine “BOOZY CATEGORISING SEARCH ENGINE FOR BEST SEARCH” consisting of a simple indexing system and query processing system is ...the search terms found in the pages and ...

5

A Learning Automata based Algorithm for Solving Traveling Salesman Problem improved by Frequency based Pruning

A Learning Automata based Algorithm for Solving Traveling Salesman Problem improved by Frequency based Pruning

... Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan chain optimization and drilling problem ...

7

Analysis of a Single-Agent Search

Analysis of a Single-Agent Search

... single-agent search has been much less investigated. It was first discovered in 2003 by Bulitko et ...was first demonstrated on a synthetic, two-level search ...synthetic search trees ...

8

Best First and Greedy Search Based CFS- Naïve Bayes Classification Algorithms for Hepatitis Diagnosis

Best First and Greedy Search Based CFS- Naïve Bayes Classification Algorithms for Hepatitis Diagnosis

... The main purpose of this paper is to deal with classification algorithm with feature selection is used to improve the prediction accuracy in the medical data. This paper applies best first search and ...

8

A tensor based selection hyper heuristic for cross domain heuristic search

A tensor based selection hyper heuristic for cross domain heuristic search

... level heuristic is chosen randomly, if a heuristic per- turbs a solution and consistently generates highly worsening solutions, then such a heuristic is considered as a poor heuristic, causing ...

47

A Study and Application of Scatter Search Feed ACO Algorithm in Forecasting the Influence of Turning Parameters during AlMg1SiCu Machining

A Study and Application of Scatter Search Feed ACO Algorithm in Forecasting the Influence of Turning Parameters during AlMg1SiCu Machining

... Scatter Search Feed ACO Algorithm. The second best algorithm’s (Scatter Search Algorithm) outcome is taken as the input to the first best algorithm (Ant Colony Optimisation Algorithm) ...

11

Motion Planning for Manipulation With Heuristic Search

Motion Planning for Manipulation With Heuristic Search

... The first category measures the computational resources required to compute a path, such as average planning or postprocessing ...a first step towards understanding the details surrounding that ...

198

Show all 10000 documents...

Related subjects