Approximate Synthesis of Н_∞ – Controllers in Nonlinear Dynamic Systems over a Semi-Infinite Time Period by A. V. Panteleev, A. A. Yakovleva

“…In this paper, in order to fill the existing gap, sufficient conditions for the existence of control for one of the frequently encountered classes of nonlinear systems are formulated and proven, which will then be used as a theoretical basis for developing approximate algorithms for finding it.Materials and Methods. …”
Get full text

Classical special functions of matrix arguments by Dmytro Shutiak, Gleb Podkolzin, Victor Bondarenko, Yury Chapovsky

“…To achieve this, we refrain from using any numerical approximation algorithms and instead rely on properties of matrices, the matrix exponential, and the Jordan normal form for matrix representation. …”
Get full text

Application of Bivariate Reproducing Kernel-Based Best Interpolation Method in Electrical Tomography by Yongguang Tan, Jingqi Wang, Junqi Yu, Boqi Wu, Jinchao Shen, Xiangchen Guo

“…Although existing interpolation approximation algorithms can alleviate the effects of the ill-posed solutions to some extent, the imaging results remain suboptimal due to the limited approximation capability of these methods. …”
Get full text

A Cross-Entropy Approach to the Domination Problem and Its Variants by Ryan Burdett, Michael Haythorpe, Alex Newcombe

“…There are a wealth of highly developed heuristics and approximation algorithms for the domination problem; however, such heuristics are much less common for variants of the domination problem. …”
Get full text

A Mixed Integer Programming Approach to the Rechargeable Rover Routing Problem on Mars by Burzyński Wojciech, Kaleta Mariusz

“…However, for future missions involving swarms of rovers, the development of more efficient heuristic or approximation algorithms will be necessary.…”
Get full text

Mathematical Modeling and Optimal Blank Generation in Glass Manufacturing by Raymond Phillips, Matthew Woolway, Dario Fanucchi, M. Montaz Ali

“…Some bounds and heuristics are developed, and two exact algorithms (depth-first search and branch-and-bound) are applied to the problem, as well as one approximate algorithm (NOMAD). It is found that wastage reduces dramatically as N increases, but this trend becomes less pronounced for larger values of N (beyond 6 or 7). …”
Get full text

Approximating Betweenness Centrality to Identify Key Nodes in a Weighted Urban Complex Transportation Network by Weiyan Liu, Xin Li, Tao Liu, Bin Liu

“…This study also uses weighted roads to construct an L-space weighted transportation network and an approximate algorithm for betweenness centrality in order to reduce the complexity of the calculations. …”
Get full text

Latency-optimal virtual backbone construction with acoustic communication in underwater sensor networks by Xin Bai, Xiaohui Wei, Sen Bai

“…We abstract a wireless sensor network as a graph with weighted edges, where the weight of an edge represents the latency between the wireless nodes it links. Three approximation algorithms are proposed to optimize the latency of a connected dominating set. …”
Get full text

A Simulated Annealing Algorithm for the Generalized Quadratic Assignment Problem by Alan McKendall, Yugesh Dhungel

“…This paper presents simple but very effective approximation algorithms for solving real-world, large-size GQAP instances quickly without spending a lot of time setting the algorithm parameters, since there are few parameters to set. …”
Get full text

Finding the Shortest Path with Vertex Constraint over Large Graphs by Yajun Yang, Zhongfei Li, Xin Wang, Qinghua Hu

“…We prove the ratio bound is 3 for our approximate algorithm. We confirm the efficiency of our algorithms by extensive experiments on real-life datasets. …”
Get full text

Tuning of PID Controller Coefficients for AVR Systems by SA Algorithm by Maryam Ehsani, Morassae Shafiezad

“…Considering complexity of the problem and real systems requirements, various methods, including exact methods and approximation algorithms, have been implemented for this purpose. …”
Get full text

Hyperbolic Metric Spaces and Stochastic Embeddings by Chris Gartland

“…Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of stochastic embeddings in the infinite setting with an aim toward applications to Lipschitz free space theory. …”
Get full text

Water‐to‐Air Imaging: A Recovery Method for the Instantaneous Distorted Image Based on Structured Light and Local Approximate Registration by Bijian Jian, Ting Peng, Xuebo Zhang, Changyong Lin

“…On this basis, the local approximate algorithm is used to reconstruct the distortion‐free scene image. …”
Get full text

Suppressing the Endogenous Negative Influence Through Node Intervention in Social Networks by Satoshi Furutani, Tatsuhiro Aoshima, Toshiki Shibahara, Mitsuaki Akiyama, Masaki Aida

“…We prove that this problem is NP-hard and propose approximation algorithms to identify optimal intervention nodes that minimize the negative influence. …”
Get full text

Energy-Efficient Computation Offloading and Resource Allocation in SWIPT-Based MEC Networks by E. Xuefei, Zhonggui Ma, Kaihang Yu

“…The simulation results show that the energy efficiency of the binary offloading algorithm proposed in this article is 11% higher than the approximate algorithm based on the binary offloading KKT algorithm, and the relationship between various preset parameters and energy efficiency in the network is discussed.…”
Get full text

Comparison, optimization and application of multiple prestack inversion algorithm for intermediate basic volcanic reservoirs: A case study of Huoshiling Formation in Chaganhua area by LI Ruilei,CAO Lei,FAN Xuepei,FENG Xiaohui,LI Ning

“…Based on these comprehensive analyses, the approximate algorithms developed by SMITH & GIDLOW and FATTI were identified as preferable choices. …”
Get full text

PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM by Chandra Agung, Natalia Christine

“…These three approximate methods are chosen because they are effective algorithms, easy to implement and provide good solutions for combinatorial optimization problems. Exact and approximate algorithms are tested in several sizes of city tour problems: 6, 9, 10, 16, 17, 25, 42, and 58 cities. 17, 42 and 58 cities are derived from tsplib: a library of sample instances for tsp; and others are taken from big cities in Java (West, Central, East) island. …”
Get full text

Optimizing winner determination for sustainability and timeliness in fresh agricultural product logistics service procurement auctions: insights from a fourth-party logistics persp... by Yi Zhou, Mingqiang Yin, Qiang Liu, Xiaohu Qian, Delong Jin, Xianming Lang

“…Based on Latin hypercube sampling approach, this paper reconstructs the traditional SAA algorithm framework, and combines the dual decomposition and Lagrangian relaxation algorithm to develop a sampling-based approximate algorithm to solve the proposed model. The effectiveness of the proposed model and algorithm is demonstrated through a real case from a logistics enterprise in Shenzhen, China, revealing the complex coupling relationship between carbon caps, time window sizes, and decision outcomes, thereby providing insights for 4PL management practices in fresh agricultural product transportation.…”
Get full text

Algoritmos Wavenet con Aplicaciones en la Aproximación de Señales: un Estudio Comparativo by C.R. Domínguez Mayorga, M.A. Espejel Rivera, L.E. Ramos Velasco, J.C. Ramos Fernández, E. Escamilla Hernández

“…Palabras clave: Procesamiento de señales, Algoritmos auto-ajustables, Redes neuronales, Algoritmos de aproximación, Método del gradiente, Keywords: Signal processing, Self-adapting algorithms, Neural networks, Approximation algorithms, Gradient methods…”
Get full text