Graphical model based spatio-temporal modeling of extreme events by Zhang, Liaofan

“…The resulting problem can be simplified as a Gaussian graphical model inference problem and therefore embedded subgraph algorithm can be used to infer the marginal mean while low-rank approximation algorithm to learn the marginal variance. …”
Get full text

Charge sharing non-binary SAR ADC by Chen, Xiangchen, Yuan, Chao, Lam, Yvonne Ying Hung

“…This paper presents a non-binary passive charge sharing SAR ADC and an optimization method for non-binary successive approximation algorithm. The passive charge sharing ADC is designed. …”
Get full text
Get full text

Decidability results for multi-objective stochastic games by Brenguier, R, Forejt, V

“…The games have previously been shown not to be determined, and an approximation algorithm for computing a Pareto curve has been given. …”

Finite-horizon equilibria for neuro-symbolic concurrent stochastic games by Yan, R, Santos, G, Duan, X, Parker, D, Kwiatkowska, M

“…We then propose an approximation algorithm called frozen subgame improvement, which proceeds through iterative solution of nonlinear programs. …”

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting by Bateni, MohammadHossein, Hajiaghayi, MohammadTaghi, Marx, Dániel, Demaine, Erik D

“…We present the first polynomial-time approximation scheme (PTAS), i.e., (1+ε)-approximation algorithm for any constant ε> 0, for the planar group Steiner tree problem (in which each group lies on a boundary of a face). …”
Get full text
Get full text

The two-flight low risk helicopter transportation problem under the split pickup scenario by Hans Kellerer, Vitaly A. Strusevich

“…We also develop a fully polynomial-time approximation scheme and a fast 5/4-approximation algorithm. The results of computational experiments with our algorithms are reported.…”
Get full text

Analysis of Transmissions Scheduling with Packet Fragmentation by Nir Namman, Raphaël Rom

“…The cost associated with fragmentation renders the problem NP-hard, therefore an approximation algorithm is needed. We define a version of the well-known Next-Fit algorithm, capable of fragmenting items, and investigate its performance. …”
Get full text

Cubical coloring — fractional covering by cuts and semidefinite programming by Robert Šámal

“…We also provide a polynomial time approximation algorithm based on semidefinite programming and in particular on vector chromatic number (defined by Karger, Motwani and Sudan [Approximate graph coloring by semidefinite programming, J. …”
Get full text

Monte Carlo Based Personalized PageRank on Dynamic Networks by Zhang Junchao, Chen Junjie, Jiancheng Song, Rong-Xiang Zhao

“…In a dynamic network, first, we do a random walk starting from each node and save the performed walks into a fingerprint database; second, we update the fingerprint database in a fixed time interval with our proposed update algorithm; finally, when a query is issued by a user, we estimate the Personalized PageRank vector by our proposed approximation algorithm. Experiments on real-world networks show that our method can handle multichanges of the underlying network at a time and is more efficient than related work, so it can be used in real incremental Personalized PageRank-based applications.…”
Get full text

Communication capacity maximization in drone swarms by Farrukh Javed, Humayun Zubair Khan, Raheel Anjum

“…Therefore, outer approximation algorithm has been applied that achieves near-optimal solutions with reduced convergence time and complexity compared with exhaustive search. …”
Get full text

Exploratory Landscape Validation for Bayesian Optimization Algorithms by Taleh Agasiev, Anatoly Karpenko

“…The quality of surrogate models, and hence the performance of an optimization algorithm, can be greatly improved by selecting the appropriate hyperparameter values of the approximation algorithm. The common approach to finding good hyperparameter values for each iteration of Bayesian optimization is to build surrogate models with different hyperparameter values and choose the best one based on some estimation of the approximation error, for example, a cross-validation score. …”
Get full text

Sorting by reversals and block-interchanges with various weight assignments by Lin Chunhung, Lin Chun-Yuan, Lin Ying

“…An exact algorithm for the weight proportion of 1:2 is developed, and then, its idea is extended to design approximation algorithms for other weight assignments. The results of our simulations suggest that the performance of our approximation algorithm is superior to its theoretical expectation.…”
Get full text

MULTISPECTRAL IMAGE RESTORATION USING A VECTOR-VALUED REACTION-DIFFUSION BASED MIXED NOISE REMOVAL TECHNIQUE by T. Barbu

“…A finite difference method-based fast-converging approximation algorithm that solves numerically this nonlinear diffusion-based system is then proposed. …”
Get full text

Inducing Optimality in Prescribed Performance Control for Uncertain Euler–Lagrange Systems by Christos Vlachos, Ioanna Malli, Charalampos P. Bechlioulis, Kostas J. Kyriakopoulos

“…Subsequently, a successive approximation algorithm is applied, employing the acquired dynamics from the previous step, to find a near-optimal control law that takes into consideration prescribed performance specifications, such as convergence speed and steady-state error. …”
Get full text

THREE-MOMENT BASED APPROXIMATION OF PROBABILITY DISTRIBUTIONS IN QUEUEING SYSTEMS by T. I. Aliev

“…For random variables with coefficients of variation greater than unity, iterative approximation algorithm with hyper-exponential two-phase distribution based on three moments of approximated distribution is offered. …”
Get full text

Determining Position Inside Non-industrial Buildings Using Ultrasound Transducers by Juan Pérez, Josep M. Ribes, Maria Alsina, Sonia Luengo, Jordi Margalef, Francesc Escudero

“…The receivers circulating beneath the transmitters receive the codes ofthose within their detection range, translate the time delays into distances and then obtaintheir position by triangulation since the receivers know the position of every transmitter.Since the receivers are not synchronised with the common time signal or the actual speedof the sound, whose value varies appreciably with temperature, relative humidity andatmospheric pressure, a consecutive approximation algorithm has been introduced. This isbased on the fact that the Z coordinator of the receiver is known and constant and thus it is possible, with only three different identifiers received, to deduce the phase of the common time signal and estimate the speed of the sound with a fourth identifier.…”
Get full text

IMPROVEMENT OF EVOLUTIONARY STRUCTURAL OPTIMIZATION METHOD FOR 2-D MODEL by CHEN XiaoMing, LAI XiDe, TANG Jian, ZHU Li, ZHAO Xi

“…The other is interval approximation algorithm. Minimum initial rejection rate R_0minwhich fulfill removed conditions was ascertained by using this algorithm and it was used as starting value,thus other initial rejection rate R₀ were obtained by setting certain increment. …”
Get full text

Quasiperiodic Patterns of the Complex Dimensions of Nonlattice Self-Similar Strings, via the LLL Algorithm by Michel L. Lapidus, Machiel van Frankenhuijsen, Edward K. Voskanian

“…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-similar fractal string. …”
Get full text

Multiobjective Optimization of a Metal Complex Catalytic Reaction Based on a Detailed Kinetic Model with Parallelization of Calculations by Sergey Koledin, Kamila Koledina, Irek Gubaydullin

“…The solution of the multiobjective optimization problem was performed with the help of the Pareto approximation algorithm. The problem of multiobjective optimization of the reaction process conditions for the olefin hydroalumination catalytic reaction, with the presence of organoaluminum compounds diisobutylaluminiumchloride, diisobutylaluminiumhydrate, and triisobutylaluminum, was solved. …”
Get full text

A Simulation-Based Optimization Method for Hybrid Frequency Regulation System Configuration by Jie Song, Xin Pan, Chao Lu, Hanchen Xu

“…Taking advantage of the gradient-based approximation algorithm, we are then able to optimize the capacity of a hybrid system. …”
Get full text