A spiking photonic neural network of 40 000 neurons, trained with latency and rank-order coding for leveraging sparsity by Ria Talukder, Anas Skalli, Xavier Porte, Simon Thorpe, Daniel Brunner

“…Training is performed via liquid state machine concepts combined with the hardware-compatible simultaneous perturbation stochastic approximation algorithm, marking its first use in photonic neural networks. …”
Get full text

Joint Resource Allocation and Power Control in Rate-Splitting Multiple Access-Based Integrated Terrestrial and Non-Terrestrial Networks With HAP Assistance by Thong-Nhat Tran, Young Jeon, Heejung Yu, Taejoon Kim

“…The non-convex JRPS problem is reformulated as a linear program and solved using an iterative successive convex approximation algorithm that ensures local optimality. Additionally, a heuristic resource allocation and power control method is also proposed to provide an effective initialization for JRPS and to serve as a performance baseline. …”
Get full text

Pilot-Based Codebook Non-Orthogonal Artificial Noise Schemes for Physical Layer Security: Secrecy Capacity Optimization Under Unknown Eavesdropper Channels by Yi Zhang, Yebo Gu, Tao Zhao, Bo Wang

“…It uses the successive convex approximation algorithm to analyze the optimal power allocation strategy and the maximum number of eavesdropper antennas that the system can tolerate under these conditions. …”
Get full text

HENCE: Hardware End-to-End Neural Conditional Entropy Encoder for Lossless 3D Medical Image Compression by Jietao Chen, Qianhao Chen, Huan Zhang, Weijie Chen, Wei Luo, Feng Yu

“…To obtain the cumulative distribution function of the discrete logistic distribution, we further introduce a high-precision Sigmoid approximation algorithm, using the Newton-Raphson method. …”
Get full text

A Novel Mathematical Model for Radio Mean Square Labeling Problem by Elsayed Badr, Shokry Nada, Mohammed M. Ali Al-Shamiri, Atef Abdel-Hay, Ashraf ELrokh

“…A comparison between the proposed approximate algorithm and the proposed mathematical model is given. …”
Get full text

Approximate Techniques in Solving Optimal Camera Placement Problems by Jian Zhao, Ruriko Yoshida, Sen-ching Samson Cheung, David Haws

“…There exists a myriad of approximate algorithms for BIP problems, but their applications, efficiency, and scalability in solving camera placement are poorly understood. …”
Get full text

Targeted Influential Nodes Selection in Location-Aware Social Networks by Susu Yang, Hui Li, Zhongyuan Jiang

“…We theoretically show that our approximate algorithm can provide a guarantee on the seed quality. …”
Get full text

Multi-project scheduling under uncertainty and resource flexibility: a systematic literature review by Marzieh Aghileh, Anabela Tereso, Filipe Alvelos, Maria Odete Monteiro Lopes

“…The results show that the main focus of the existing research has been devoted to approximate algorithms. Genetic algorithms (GAs) and priority rules (PRs) are the most representative approximate algorithms, with 39% and 18%, respectively. …”
Get full text

MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM by Rudolf A. Neydorf, Artem A. Zhikulin

“…The comparative analysis with such approximate algorithms as the critical pat h technique (CPT) and the evolutional genetic algorithm (EGA) is carried out. …”
Get full text

Utilizing weak graph for edge consolidation-based efficient enhancement of network robustness by Wei Ding, Zhengdan Wang

“…We compare the proposed algorithm with optimal and approximate algorithms across graphs of varying scales. The outcomes indicate that, for small graphs where the optimal algorithm is applicable, the algorithm achieves 100% consolidation efficacy. …”
Get full text

Algorithm for Determining the Sum Formula of Metabolites from Mass Spectrometry Spectra by Borowski Marcin, Baumgard Karolina

“…This work addresses the challenge of determining chemical sum formulas from mass spectrometry data through a three-fold approach: establishing a formal problem framework, analyzing its computational complexity, and developing an approximate algorithm that synergizes reference database integration with functional group property analysis to enable accurate compound identification and structural characterization. …”
Get full text

The Numerical Technique Based on Shifted Jacobi-Gauss-Lobatto Polynomials for Solving Two Dimensional Multi-Space Fractional Bioheat Equations by Firas Amer Al-Saadawi, Hameeda Al-Humedi1

“…This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). …”
Get full text

Researches on the problem of link disjoint paths pair with QoS constraints by ZHANG Pin 1, ZHANG Jian-wu1, LI Le-min 2, WANG Sheng2

“…The problem of link disjoint paths pair with QoS constraints was discussed.Two routing models about link dis-joint optimal paths pair with QoS constraints were constructed.First it proved that the problem of link disjoint paths pair in the undirected graph without end to end QoS constraints counld be converted to the correspond problem in its link split graph,while the problem with end to end QoS constraints counld not be converted.Then it’s proved that both of these questions are NP complete.Finally the approximation algorithms is given and simulation on them is made.…”
Get full text

Enhancing computational efficiency in solving Knapsack problem: insights from algorithmic parallelization and optimization by Bashar Bin Usman, Okeyinka Aderemi Elisha, Ibrahim Abdullahi, Idris Rabiu, Adamu Isah, Abdulganiyyu Abdulrahman

“…Hence, the application of approximate algorithms is usually considered when encountering this optimization problem. …”
Get full text

High-Order Algorithms for Riesz Derivative and Their Applications (I) by Hengfei Ding, Changpin Li, YangQuan Chen

“…Using these derived schemes, we can get high-order algorithms for the Riesz fractional derivative. Based on the approximate algorithm, we construct the numerical scheme for the space Riesz fractional diffusion equation, where a fourth-order scheme is proposed for the spacial Riesz derivative, and where a compact difference scheme is applied to approximating the first-order time derivative. …”
Get full text

On coding over the spatial-temporal diversity for reliable transmission scheme in low-duty-cycle WSN by Yu-bo YAN, Pan-long YANG, Lei ZHANG, Zheng-lun QIU, Shan-lin HONG

“…A reliable data delivery scheme for low-duty-cycle wireless sensor networks(WSN)was proposed.Using this scheme,the unique spatial-temporal diversity in low-duty-cycle WSN was explored and exploited.Combining with coding schemes,the proposed scheme could achieve higher energy efficiency and lower delivery delay.The coding block allocation problem over multiple paths was formulated.As it was NP-hard,an approximate algorithm to tackle this difficulty was proposed.The impact of network parameters was further analyzed with experimental methods.Extensive simulations also show that,the coding over the spatial-temporal diversity scheme could achieve relatively reliable and low delay delivery with relatively less energy.…”
Get full text

Pareto Optimal Solutions for Stochastic Dynamic Programming Problems via Monte Carlo Simulation by R. T. N. Cardoso, R. H. C. Takahashi, F. R. B. Cruz

“…This new idea is carried out by using Monte Carlo simulations embedded in an approximate algorithm proposed to deterministic dynamic programming problems. …”
Get full text

A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network by Deqian Fu, Lihua Han, Zifen Yang, Seong Tae Jhang

“…Many researchers have been devoted to designing approximate algorithms for CDS problem since constructing the minimum CDS (MCDS) is NP-hard problem. …”
Get full text

Approximating optimization problems in graphs with locational uncertainty by Marin Bougeret, Jérémy Omer, Michael Poss

“…We propose two types of polynomial-time approximation algorithms. The first one relies on solving a deterministic counterpart of the problem where the uncertain distances are replaced with maximum pairwise distances. …”
Get full text

INVESTIGATION OF KROHN’S ALGORITHM AND ITS MODIFICATION FOR VARIOUS BASIC DATA by Valery Grigoryevich Kobak, Dmitry Vyacheslavovich Titov, Oleg Anatolyevich Zolotykh

“…It is proposed to use approximate algorithms for the solution to the problem. Both Krohn’s classical and modified algorithms, and the techniques of improving them through the initial task distribution among the computer system devices are considered. …”
Get full text