Results 311 to 320 of about 36,225 (338)

Divide-and-conquer algorithms for graph-layout problems

Networks, 1996
Summary: W. T. Tutte (1966) introduced a decomposition of 2-connected graphs which has widely been used in solving various graph-theoretic problems. We extend it to a class of graph-layout problems, namely, determining the bandwidth, cutwidth, and pagenumber of graphs.
openaire   +2 more sources

A faster divide-and-conquer algorithm for constructing delaunay triangulations

Algorithmica, 1987
An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation of n sites in the plane is presented. The change reduces its \(\theta\) (n log n) expected running time to O(n log log n) for a large class of distributions that includes the uniform distribution in the unit square.
openaire   +2 more sources

Divide-and-Conquer Algorithms

2021
openaire   +1 more source

A divide-and-conquer algorithm for curve fitting

Computer-Aided Design, 2022
Diego Buchinger, Roberto Silvio Ubertino Rosso   +1 more
openaire   +1 more source

Implementation of divide-and-conquer algorithms on multiprocessors

1991
Algorithms with a divide-and-conquer structure are suitable candidates for parallelization. The idea of the divide-and-conquer paradigm is to fragment a problem into subproblems of the same kind, to solve the subproblems recursively, and, finally, to combine the solutions of the subproblems into a solution of the original problem.
openaire   +1 more source

Noisy intermediate-scale quantum algorithms

Reviews of Modern Physics, 2022
Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw   +2 more
exaly  

Variational quantum algorithms

Nature Reviews Physics, 2021
Marco Cerezo, Andrew Arrasmith, Ryan Babbush   +2 more
exaly  

Quantum Information and Algorithms for Correlated Quantum Matter

Chemical Reviews, 2021
Kade Head-Marsden, Johannes Flick, Christopher Ciccarino   +2 more
exaly  

Parallelizing divide-and-conquer algorithms — Microtasking versus autotasking

1990
Algorithms based on a divide-and-conquer strategy are well qualified for being implemented in a multitasking environment. The idea of the divide-and-conquer paradigm is to fragment a problem into subproblems of the same kind, to solve the subproblems recursively, and, finally, to combine the solutions of the subproblems into a solution of the original ...
openaire   +1 more source

A review of cancer immunotherapy toxicity

Ca-A Cancer Journal for Clinicians, 2020
Lucy Boyce Kennedy
exaly