Successful algorithms have been developed for computing Nash equilibrium in a variety of finite game classes. However, solving continuous games—in which the pure strategy space is (potentially uncountably) infinite—is far more challenging. Nonetheles...
The goal of digital forensics is to recover and investigate pieces of data found on digital devices, analysing in the process their relationship with other fragments of data from the same device or from different ones. Approximate matching functions,...
Route game is recognized as an effective method to alleviate Braess’ paradox, which generates a new traffic congestion since numerous vehicles obey the same guidance from the selfish route guidance (such as Google Maps). The conventional route...
The security of several fully homomorphic encryption (FHE) schemes depends on the intractability assumption of the approximate common divisor (ACD) problem over integers. Subsequent efforts to solve the ACD problem as well as its variants were also d...
This paper concerns several important topics of the Symmetry journal, namely, computer-aided design, computational geometry, computer graphics, visualization, and pattern recognition. We also take advantage of the symmetric structure of the tensor-pr...
We propose a two-stage method to test the robustness of the generalized approximate message passing algorithm (GAMP). A pursuit process based on the marginal posterior probability is inserted in the standard GAMP algorithm to find the support of a sp...
Conventional synthetic aperture radar (SAR) imaging algorithms establish the echo signal model based on the exact hyperbolic range equation and compensate for the range-azimuth coupling through complicated approximations to obtain high-resolution SAR...
In this paper, we study a fixed-point problem with a set-valued mapping by using an algorithm based on unions of nonexpansive mappings. We show that an approximate solution is reached after a finite number of iterations in the presence of computation...
Aiming at the problems of synthetic-aperture radar (SAR), such as high sampling rate and vulnerability to noise interference in imaging, a sparse reconstruction algorithm based on approximate observation and L1/2 threshold iteration is proposed in th...
Magnetic resonance imaging (MRI) is extensively exploited for more accurate pathological changes as well as diagnosis. Conversely, MRI suffers from various shortcomings such as ambient noise from the environment, acquisition noise from the equipment,...
This paper aims to propose a new photoacoustic/ultrasound endoscopic imaging reconstruction algorithm based on the approximate Gaussian acoustic field which significantly improves the resolution and signal-to-noise ratio (SNR) of the out-of-focus reg...
In this paper, we propose a fast sparse recovery algorithm based on the approximate l0 norm (FAL0), which is helpful in improving the practicability of the compressed sensing theory. We adopt a simple function that is continuous and differentiable to...
In this paper an algorithm for approximate solving of a boundary value problem for a nonlinear differential equation with a special type of fractional derivative is suggested. This derivative is called a generalized proportional Caputo fractional der...
A new methodology is introduced to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). This methodology is termed the “Boolean-Hamiltonians Transform for QAOA” (BHT-QAOA). Because...
The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a lattice self-s...
Approximate Message Passing (AMP) and Generalized AMP (GAMP) algorithms usually suffer from serious convergence issues when the elements of the sensing matrix do not exactly match the zero-mean Gaussian assumption. To stabilize AMP/GAMP in these cont...
The entirety of the information regarding a subatomic particle is encoded in a wave function. Solving quantum mechanical models (QMMs) means finding the quantum mechanical wave function. Therefore, great attention has been paid to finding solutions f...
Sixth-generation wireless (6G) technology has been focused on in the wireless research community. Global coverage, massive spectrum usage, complex new applications, and strong security are among the new paradigms introduced by 6G. However, realizing...
Considering the stability and safety of industrial production, the open-loop system cannot meet the requirements of industrial production, so more and more attention has been paid to multivariable closed-loop system identification. This study focuses...
The main aim of this paper is to suggest an algorithm for constructing two monotone sequences of mild lower and upper solutions which are convergent to the mild solution of the initial value problem for Riemann-Liouville fractional delay differential...
In modern computers, complicated signal processing is highly optimized with the use of compilers and high-speed processing using floating-point units (FPUs); therefore, programmers have little opportunity to care about each process. However, a highly...
The accelerating integration of renewable energy sources into modern power grids has created unprecedented operational challenges, with significant system cost volatility under extreme uncertainty events. To address this challenge, this paper present...
The set packing problem is a core NP-complete combinatorial optimization problem which aims to find the maximum collection of disjoint sets from a given collection of sets, S, over a ground set, U. Evolutionary algorithms (EAs) have been widely used...
This paper introduces efficient randomized fixed-precision and single-pass algorithms for low-tubal-rank approximation of third-order tensors. The proposed fixed-precision algorithms are faster and more efficient than the existing algorithms for appr...
The approximate pole/zero expressions are computed starting from the state or the “state-like” matrix. The attempts of open-circuit and short-circuit replacement of circuit elements are combined with those to cut row and column groups of...
We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility. Given a set of targets to be covered and a set of mobile sensors, we seek a sensor dispatch algorithm maximizing th...
We propose an approximation algorithm for scheduling jobs with release and delivery times on a single machine with the objective to minimize the makespan. The algorithm is based on an implicit enumeration of the set of complete solutions in a search...
We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. In order to be efficient in terms of both time and space, our algorithm is based on a decom...
The problem of optimal multicast routing in Wireless Mess Networks (WMNs) with Quality-of-Service (QoS) provisioning, which is Non-Deterministic Polynomial (NP)-complete, is studied in this paper. The existing algorithms are not very efficient or eff...
We study the design of efficient approximation algorithms for the ℓ-center clustering and minimum-diameter ℓ-clustering problems in high-dimensional Euclidean and Hamming spaces. Our main tool is randomized dimension reduction. First, we...
Packing algorithms are broadly used to avoid anti-malware systems, and the proportion of packed malware has been growing rapidly. However, just a few studies have been conducted on detection various types of packing algorithms in a systemic way. Foll...
In this paper, we propose a novel, highly accurate numerical algorithm for matrix exponentials (MEs). The algorithm is based on approximating Putzer’s algorithm by analytically solving the ordinary differential equation (ODE)-based coefficients...
Low Density Parity Check (LDPC) codes are currently being deeply analyzed through algorithms that require the capability of addressing their iterative decoding convergence performance. Since it has been observed that the probability distribution func...
Given a directed graph G with non-negative cost on the arcs, a directed tour cover T of G is a cycle (not necessarily simple) in G such that either head or tail (or both of them) of every arc in G is touched by T. The minimum directed tour cover prob...
This paper contains two main parts, Part I and Part II, which discuss the local and global minimization problems, respectively. In Part I, a fresh conjugate gradient (CG) technique is suggested and then combined with a line-search technique to obtain...
We give a -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people an...
Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Desp...
Quantum optimization algorithms are some of the most promising algorithms expected to show a quantum advantage. When solving quadratic unconstrained binary optimization problems, quantum optimization algorithms usually provide an approximate solution...
To address the drawbacks of the slow convergence speed and lack of individual information exchange in the cuckoo search (CS) algorithm, this study proposes an improved cuckoo search algorithm based on a sharing mechanism (ICSABOSM). The enhanced algo...
Competitive Influence Maximization (
A grammar-based compressor is an algorithm that receives a word and outputs a context-free grammar that only produces this word. The approximation ratio for a single input word is the size of the grammar produced for this word divided by the size of...
The Influence Maximization (
We present a novel approach to performing fitness approximation in genetic algorithms (GAs) using machine learning (ML) models, focusing on dynamic adaptation to the evolutionary state. We compare different methods for (1) switching between actual an...
We investigate the Pareto-scheduling problem with two competing agents on a single machine to minimize the total weighted completion time of agent A’s jobs and the total weighted late work of agent B’s jobs, the B-jobs having a common due...
Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression. Our algorithm guarantees O(log2 n)- approximat...
Since the conventional split–merge algorithm is sensitive to the object scale variance and splitting starting point, a piecewise split–merge polygon-approximation method is proposed to extract the object contour features. Specifically, th...
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but var...
As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environmental monitoring and data collection...
We address the problem of approximating a set-valued function F, where
When the multi-receiver synthetic aperture sonar (SAS) works with a wide-bandwidth signal, the performance of the range-Doppler (R-D) algorithm is seriously affected by two approximation errors, i.e., point target reference spectrum (PTRS) error and...
of 163