A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers

Saeed Nejati; Zack Newsham; Joseph Scott; Liang Jia; Catherine H. Gebotys; Pascal Poupart; Vijay Ganesh

doi:10.1007/978-3-319-66263-3_16

ScienceGate Book Chapters

BOOK-CHAPTER

A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers

Saeed Nejati Zack Newsham Joseph Scott Liang Jia Catherine H. Gebotys Pascal Poupart Vijay Ganesh

Year: 2017 Lecture notes in computer science Pages: 251-260 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-319-66263-3_16

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Divide and conquer algorithms Solver Benchmark (surveying) Heuristic Theoretical computer science Context (archaeology) Mathematical optimization Algorithm Parallel computing Mathematics Artificial intelligence Programming language

Metrics

Cited By

4.77

FWCI (Field Weighted Citation Impact)

Refs

0.95

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logic, programming, and type systems

Physical Sciences → Computer Science → Artificial Intelligence

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers

Metrics

Citation History

Topics

Related Documents

A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers

Unified architecture for divide and conquer based tridiagonal system solvers

Chronological decomposition heuristic for scheduling: Divide and conquer method

Learning Rate Based Branching Heuristic for SAT Solvers

DCSolver: Accelerating Sparse Iterative Solvers via Divide-and-Conquer on GPUs