Results 51 to 60 of about 522,371 (218)
Optimal with Respect to Accuracy Recovery of Some Classes Functions by Fourier Series
Кібернетика та комп'ютерні технологіїIntroduction. Function approximation (approximation or restoration) is widely used in data analysis, model building, and forecasting. The goal of function approximation is to find the function that best approximates the original function.
Olena Kolomys
doaj +1 more source
Improved Approximation Algorithms for k-Submodular Function Maximization
, 2015 This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where $a=\max\{1, \sqrt{(k-1)/
Iwata, Satoru +2 more
core +1 more source
The Finite Elements Research for Calculation of Thin-Walled Bar Systems [PDF]
Инженерно-строительный журнал, 2012 This article is written to continue the article of recent issue of the journal (Lalin V.V., Rybakov V.A. The finite elements for design of building walling made of thin-walled beams) considered the creating of 4 types of finite elements – depending on a ...
S.A. Morozov, V.A. Rybakov, V.V. Lalin
doaj
Abstract and Applied Analysis, 2013 We extend the application of the Galerkin method for treating the multiterm fractional differential equations (FDEs) subject to initial conditions. A new shifted Legendre-Galerkin basis is constructed which satisfies exactly the homogeneous initial ...
A. H. Bhrawy, M. A. Alghamdi
doaj +1 more source
On distributed power control in full duplex wireless networks
Digital Communications and Networks, 2017 In this paper, we first consider the problem of distributed power control in a Full Duplex (FD) wireless network consisting of multiple pairs of nodes, within which each node needs to communicate with its corresponding node.
Yu Wang, Shiwen Mao
doaj +1 more source
Hybrid Global Search Algorithm with Genetic Blocks for Solving Hexamatrix Games
Известия Иркутского государственного университета: Серия "Математика", 2022 This work addresses the development of a hybrid approach to solving threeperson polymatrix games (hexamatrix games). On the one hand, this approach is based on the reduction of the game to a nonconvex optimization problem and the Global Search Theory ...
A. V. Orlov
doaj +1 more source
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
, 2006 In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead,
Manthey, Bodo, Ram, L. Shankar
core +4 more sources
On maximum spanning DAG algorithms for semantic DAG parsing
Annual Meeting of the Association for Computational Linguistics, 2014 Consideration of the decoding problem in semantic parsing as finding a maximum spanning DAG of a weighted directed graph carries many complexities that haven’t been fully addressed in the literature to date, among which are its actual appropriateness for
Natalie Schluter
semanticscholar +1 more source
Stochastic approximation algorithms for partition function estimation of Gibbs random fields [PDF]
IEEE Transactions on Information Theory, 1997 Summary: We present an analysis of recently proposed Monte Carlo algorithms for estimating the partition function of a Gibbs random field. We show that this problem reduces to estimating one or more expectations of suitable functionals of the Gibbs states with respect to properly chosen Gibbs distributions.
Potamianos, Gerasimos, Goutsias, John
openaire +1 more source
Proceedings of the International Conference on Applied Innovations in ITThe article considers the possibilities of solving interpolation and approximation problems using special types of functions, such as root polynomials and root fractional rational, and provides relevant examples.
Igor Melnyk +3 more
doaj +1 more source