Parallel Decision Tree Search

Parallel Decision Tree Search is a parallel search algorithm that belongs to the class of decision tree-based methods, distinguished by its simultaneous exploration of multiple branches within a decision tree structure to accelerate the search process in parallel computing environments.

7

Publications

1.3K

Citations

19

Authors

11

Institutions

Publications per year

2017–2026

3

Authors

19

  1. LW
    Lidong Wang

    Dalian Maritime University, China

    2 publications · 350 citations

    2

    h-index

  2. YM
    Yashuang Mu

    Henan University of Technology, China

    2 publications · 350 citations

    2

    h-index

  3. XL
    Xiaodong Liu

    Dalian University of Technology, China

    2 publications · 350 citations

    2

    h-index

  4. RA
    Rakesh Agrawal

    IBM Research - Almaden, United States

    1 publications · 782 citations

    1

    h-index

  5. JS
    John Shafer

    University of Wisconsin–Madison, United States

    1 publications · 782 citations

    1

    h-index

1–5 of 19

Venues

  1. Information Sciences

    1 publications · 333 citations

    1

    h-index

  2. IEEE Access

    1 publications · 42 citations

    1

    h-index

  3. Computing

    1 publications · 34 citations

    1

    h-index

  4. Pattern Recognition

    1 publications · 17 citations

    1

    h-index

  5. 1

    h-index

1–5