-
1
-
2
Approximation Algorithm for a System of Pantograph Equations
Published 2012-01-01Get full text
Article -
3
Approximate algorithm for median query based on WSN
Published 2011-01-01Subjects: Get full text
Article -
4
RSU deployment planning based on approximation algorithm in urban VANET
Published 2018-01-01Subjects: Get full text
Article -
5
Improved FFT-based alpha-stable density approximation algorithm
Published 2007-01-01“…Approximation of density of α-stable process is an elementary works in modeling network flow using α-stable process.Combining the mathematical properties of characteristic function of α-stable process with the traditional approximating algorithm,an improved FFT-based algorithm was proposed.The improved algorithm has 2 noticeable features: automatically choosing the sampling space and sampling interval,importing frequency expansion.Experiments show that it can decrease calculation complexity and effectively control computation error.…”
Get full text
Article -
6
Augmented EFIE with Adaptive Cross Approximation Algorithm for Analysis of Electromagnetic Problems
Published 2013-01-01Get full text
Article -
7
Approximation algorithm to symmetric alpha stable distribution with bi-region curve model
Published 2013-01-01Get full text
Article -
8
-
9
The Conjugate Gradient Viscosity Approximation Algorithm for Split Generalized Equilibrium and Variational Inequality Problems
Published 2018-01-01“…In this paper, we study a kind of conjugate gradient viscosity approximation algorithm for finding a common solution of split generalized equilibrium problem and variational inequality problem. …”
Get full text
Article -
10
-
11
Some complexity results on semipaired domination in graphs
Published 2024-12-01Subjects: Get full text
Article -
12
Multiobjective Optimization and Network Routing With Near-Term Quantum Computers
Published 2024-01-01Subjects: “…Approximation algorithms…”
Get full text
Article -
13
Direct blind multiuser detection without channel estimation and equalizer design
Published 2005-01-01Subjects: Get full text
Article -
14
(ε,δ)-approximate counting algorithm for large scale wireless sensor networks
Published 2013-06-01Subjects: Get full text
Article -
15
Dynamic SDN controller placement based on latency in LEO satellite network
Published 2020-03-01Subjects: Get full text
Article -
16
Two Approaches to Constructing Certified Dominating Sets in Social Networks
Published 2025-01-01Subjects: Get full text
Article -
17
Virtual network mapping strategy and competitive analysis based on cost constraint
Published 2016-02-01“…The approximation algorithm of single virtual network mapping solution aimed to minimize the mapping cost based on convex quadratic programming relaxation was designed. …”
Get full text
Article -
18
Determining Sensor Locations in Wireless Sensor Networks
Published 2015-08-01“…We show that the restricted problem is MAX-SNP hard and cannot be approximated within performance ratio 2 in polynomial time unless P = NP; we first propose a polynomial time 3 -approximation algorithm and then improve the ratio to 2 + ε for any given ε > 0 , by presenting a polynomial time randomized approximation algorithm, which is almost optimal to the restricted problem.…”
Get full text
Article -
19
Resource allocation algorithm for secure communication in UAV-assisted D2D communication network
Published 2024-02-01“…To solve the problems of energy limitation, spectrum shortage, and serious co-frequency interference in the unmanned aerial vehicle (UAV)-assisted D2D (device-to-device) communication network under passive eavesdropping, the concept of the network secrecy energy efficiency was introduced by taking into account the secrecy rate and transmit power constraints of each user.Based on the physical layer secure transmission theory, the joint optimization problem of spectrum multiplexing and power control strategies was investigated to maximize the network secrecy energy efficiency.The problem was a nonlinear nonconvex problem, a resource allocation algorithm combining Dinkelbach’s algorithm and the convex approximation algorithm was proposed to transform the nonconvex optimization problem into a geometric planning problem through the convex approximation algorithm and ensure that the original problem converges to the global optimal solution by Dinkelbach’s algorithm.Simulation results show that the proposed algorithm can effectively mitigate the co-channel interference, improve the network secrecy energy efficiency, and balance the relationship between the secure communication performance and power consumption of the network.…”
Get full text
Article -
20
Integrated Scheduling Problem on a Single Bounded Batch Machine with an Unavailability Constraint
Published 2020-01-01“…We also evaluate the performance of the approximation algorithm by the computational results.…”
Get full text
Article