Results 41 to 50 of about 522,371 (218)

Numerical Algorithms for Estimating Probability Density Function Based on the Maximum Entropy Principle and Fup Basis Functions

open access: yesEntropy, 2021
Estimation of the probability density function from the statistical power moments presents a challenging nonlinear numerical problem posed by unbalanced nonlinearities, numerical instability and a lack of convergence, especially for larger numbers of ...
Nives Brajčić Kurbaša   +3 more
doaj   +1 more source

A reliable algorithm based on the shifted orthonormal Bernstein polynomials for solving Volterra–Fredholm integral equations

open access: yesJournal of Taibah University for Science, 2018
This paper deals with the numerical solution of Volterra–Fredholm integral equations. In this work, we approximate the unknown functions based on the shifted orthonormal Bernstein polynomials, in conjunction with the least-squares approximation method ...
E. Hesameddini, M. Shahbazi
semanticscholar   +1 more source

A Model for Demand Planning in Supply Chains with Congestion Effects

open access: yesLogistics, 2021
This paper is concerned with demand planning for internal supply chains consisting of workstations, production facilities, warehouses, and transportation links.
Uday Venkatadri   +2 more
doaj   +1 more source

Optimized fixed point implementation of a local stereo matching algorithm onto C66x DSP

open access: yesProceedings of the 2014 Conference on Design and Architectures for Signal and Image Processing, 2014
Stereo matching techniques aim at reconstructing disparity maps from a pair of images. The use of stereo matching techniques in embedded systems is very challenging due to the complexity of the state-of-the-art algorithms.
Judicael Menant   +3 more
semanticscholar   +1 more source

Greedy algorithms for dirac mixture approximation of arbitrary probability density functions

open access: yes2007 46th IEEE Conference on Decision and Control, 2007
Greedy procedures for suboptimal Dirac mixture approximation of an arbitrary probability density function are proposed, which approach the desired density by sequentially adding one component at a time. Similar to the batch solutions proposed earlier, a distance measure between the corresponding cumulative distributions is minimized by selecting the ...
Hanebeck, Uwe D., Schrempf, Oliver C.
openaire   +3 more sources

A consistent approximation of the total perimeter functional for topology optimization algorithms [PDF]

open access: yesESAIM: Control, Optimisation and Calculus of Variations, 2022
This article revolves around the total perimeter functional, one particular version of the perimeter of a shape Ω contained in a fixed computational domainDmeasuring the total area of its boundary∂Ω, as opposed to its relative perimeter, which only takes into account the regions of∂Ω strictly insideD.
Amstutz, Samuel   +2 more
openaire   +2 more sources

Efficient by Precision Algorithms for Approximating Functions from Some Classes by Fourier Series

open access: yesКібернетика та комп'ютерні технології
Introduction. The problem of approximation can be considered as the basis of computational methods, namely, the approximation of individual functions or classes of functions by functions that are in some sense simpler than the functions being ...
Olena Kolomys
doaj   +1 more source

Adsorption Sites on Pd Nanoparticles Unraveled by Machine-Learning Potential with Adaptive Sampling

open access: yesMolecules, 2022
Catalytic properties of noble-metal nanoparticles (NPs) are largely determined by their surface morphology. The latter is probed by surface-sensitive spectroscopic techniques in different spectra regions.
Andrei Tereshchenko   +5 more
doaj   +1 more source

Randomized Strategies for Robust Combinatorial Optimization

open access: yes, 2018
In this paper, we study the following robust optimization problem. Given an independence system and candidate objective functions, we choose an independent set, and then an adversary chooses one objective function, knowing our choice. Our goal is to find
Kawase, Yasushi, Sumita, Hanna
core   +1 more source

Algorithms for DC Programming via Polyhedral Approximations of Convex Functions

open access: yes, 2023
There is an existing exact algorithm that solves DC programming problems if one component of the DC function is polyhedral convex (Loehne, Wagner, 2017). Motivated by this, first, we consider two cutting-plane algorithms for generating an $ε$-polyhedral underestimator of a convex function g.
Pirani, Fahaar Mansoor, Ulus, Firdevs
openaire   +2 more sources

Home - About - Disclaimer - Privacy