Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
The physical cell identity assignment problem: a practical optimization approach
CE Andrade, LS Pessoa… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
The physical cell identity (PCI) is a critical parameter to radio access networks used by the
user equipment, like a smartphone, to identify the cell to connect. The PCI misassignment …
user equipment, like a smartphone, to identify the cell to connect. The PCI misassignment …
CMOS-based single-cycle in-memory XOR/XNOR
S Alam, J Hutchins, N Shukla, K Asifuzzaman… - IEEE …, 2024 - ieeexplore.ieee.org
Big data applications are on the rise, and so is the number of data centers. The ever-
increasing massive data pool needs to be periodically backed up in a secure environment …
increasing massive data pool needs to be periodically backed up in a secure environment …
An FPGA-based max-k-cut accelerator exploiting oscillator synchronization model
MK Bashar, Z Li, V Narayanan… - 2024 25th International …, 2024 - ieeexplore.ieee.org
In this work, we demonstrate a one of its kind FPGA-based compute engine that uses new
computational models inspired by the synchronization dynamics of coupled oscillators to …
computational models inspired by the synchronization dynamics of coupled oscillators to …
An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
D Recalde, D Severín, R Torres, P Vaca - Journal of Combinatorial …, 2018 - Springer
In this work a balanced k-way partitioning problem with weight constraints is defined to
model the sports team realignment. Sports teams must be partitioned into a fixed number of …
model the sports team realignment. Sports teams must be partitioned into a fixed number of …
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
VJR de Sousa, MF Anjos, S Le Digabel - EURO Journal on Computational …, 2019 - Elsevier
We consider the maximum k-cut problem that involves partitioning the vertex set of a graph
into k subsets such that the sum of the weights of the edges joining vertices in different …
into k subsets such that the sum of the weights of the edges joining vertices in different …
Advances in Discrete Optimization: From Truss Design Optimization to Quantum Computing Optimization
R Fakhimi - 2024 - search.proquest.com
This manuscript explores optimization problems and spans two distinct but interconnected
parts. The first part delves into the practical application of mathematical optimization …
parts. The first part delves into the practical application of mathematical optimization …
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques
M Cordero, A Miniguano–Trujillo, D Recalde… - …, 2024 - Wiley Online Library
In this work, a graph partitioning problem in a fixed number of connected components is
considered. Given an undirected graph with costs on the edges, the problem consists of …
considered. Given an undirected graph with costs on the edges, the problem consists of …
An exact approach for the multi-constraint graph partitioning problem
D Recalde, R Torres, P Vaca - EURO Journal on Computational …, 2020 - Elsevier
In this work, a multi-constraint graph partitioning problem is introduced. The input is an
undirected graph with costs on the edges and multiple weights on the nodes. The problem …
undirected graph with costs on the edges and multiple weights on the nodes. The problem …
[PDF][PDF] Quantum-inspired Formulations for the Max k-cut Problem
Solving combinatorial optimization problems on quantum computers has attracted many
researchers since the emergence of quantum computing. The max k-cut problem is a …
researchers since the emergence of quantum computing. The max k-cut problem is a …
[PDF][PDF] The max-cut problem on classical and quantum solvers
Recent claims on “solving” combinatorial optimization problems via quantum computers
have attracted researchers to work on quantum algorithms. The max k-cut problem is a …
have attracted researchers to work on quantum algorithms. The max k-cut problem is a …