The quantum approximate optimization algorithm (QAOA) holds promise for combinatorial optimization but is constrained by limited qubits. While divide-and-conquer frameworks like QAOA 2 address ...

Abstract: This work introduces FPGA-Par, an efficient graph partitioning algorithm for multi-FPGA systems. FPGA-Par utilizes an iterative balanced partitioning and supernodes transferring algorithm ...

Multi-agent task allocation plays a crucial role in achieving efficient collaboration in heterogeneous multi-agent systems, especially in complex and dynamic environments. However, existing ...

In the field of multi-objective evolutionary optimization, prior studies have largely concentrated on the scalability of objective functions, with relatively less emphasis on the scalability of ...

ABSTRACT: A new nano-based architectural design of multiple-stream convolutional homeomorphic error-control coding will be conducted, and a corresponding hierarchical implementation of important class ...

This test was disabled because it is failing in CI. See recent examples and the most recent trunk workflow logs. Over the past 6 hours, it has been determined flaky in 9 workflow(s) with 18 failures ...

Abstract: An important application of graph partitioning is data clustering using a graph model--- the pairwise similarities between all data objects form a weighted graph adjacency matrix that ...