Graph-theoretic formulation of QUBO for scalable local search on GPUs
Heuristic solvers of the Quadratic Unconstrained Binary Optimization (QUBO) problems
have been rapidly studied because of their potentialities to solve a wide range of com …
have been rapidly studied because of their potentialities to solve a wide range of com …
Parallel vertex cover algorithms on gpus
P Yamout, K Barada, A Jaljuli… - 2022 IEEE …, 2022 - ieeexplore.ieee.org
Finding small vertex covers in a graph has applications in numerous domains such as
scheduling, computational biology, telecommunication networks, artificial intelligence, social …
scheduling, computational biology, telecommunication networks, artificial intelligence, social …
Simple iterative trial search for the maximum independent set problem optimized for the GPUs
An independent set of a graph is a subset of the nodes such that no two nodes in it are
adjacent. The maximum independent set (MIS) problem is an optimization problem to find a …
adjacent. The maximum independent set (MIS) problem is an optimization problem to find a …
Accelerating Data Analytical Algorithms on GPUs
A Gaihre - 2023 - search.proquest.com
The surge in digital technologies and internet usage has resulted in an influx of data from
diverse sources. Traditional data processing methods and computing resources prove …
diverse sources. Traditional data processing methods and computing resources prove …