Parallel algorithms for computing the smallest binary tree size in unit simplex refinement-Reference-Cited by-同舟云学术

Parallel algorithms for computing the smallest binary tree size in unit simplex refinement

Published:2018-02 Issue: Volume:112 Page:166-178
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Aparicio G.,Salmerón J.M.G.,Casado L.G.^ORCID,Asenjo R.,Hendrix E.M.T.

Funder

Spanish Ministry

European Regional Development Fund (ERDF)

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference36 articles.

1. On the Bisection Method for Triangles;Adler;Math. Comp.,1983

2. On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex;Aparicio;Informatica,2015

3. Heuristics To Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular N-Simplex, in: Computational Science and Its Applications – ICCSA 2014;Aparicio,2014

4. Parallel algorithm design for branch and bound;Bader,2004

5. On estimating workload in interval branch-and-bound global optimization algorithms;Berenguel;J. Global Optim.,2013

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Practical Improvement in the Implementation of Two Avalanche Tests to Measure Statistical Independence in Stream Ciphers;Computation;2024-03-19

3. A causal model for short‐term time series analysis to predict incoming Medicare workload;Journal of Forecasting;2020-07-20

4. A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster;Applied Sciences;2019-12-09

5. Globally maximizing the sum of squares of quadratic forms over the unit sphere;Optimization Letters;2019-11-04