Efficient parallel algorithms for search problems: applications in VLSI CAD

2002 ◽  
Author(s):  
S. Arvindam ◽  
V. Kumar ◽  
V.N. Rao
Keyword(s):  
Parallel Algorithms ◽  
Search Problems ◽  
Vlsi Cad

scholarly journals Space-efficient parallel algorithms for combinatorial search problems

2015 ◽  
Vol 76 ◽  
pp. 58-65 ◽  
Author(s):  
A. Pietracaprina ◽  
G. Pucci ◽  
F. Silvestri ◽  
F. Vandin
Keyword(s):  
Parallel Algorithms ◽  
Combinatorial Search ◽  
Search Problems

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.

Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms

2019 ◽  
Vol 38 (4) ◽  
pp. 817-850 ◽  
Author(s):  
Luisa D'Amore ◽  
Valeria Mele ◽  
Diego Romano ◽  
Giuliano Laccetti
Keyword(s):  
Performance Analysis ◽  
Parallel Algorithms ◽  
Algebraic Approach
Sign in / Sign up

Export Citation Format

Share Document