Results 1 to 10 of about 522,371 (218)

Approximated Dynamic Programming for Production and Inventory Planning Problem in Cold Rolling Process of Steel Production

open access: yesMathematics
We study a multi-product production and inventory planning problem with uncertain demand in the cold rolling stage of steel production processes. The problem is to determine the production amount of each product in each planning period so that the sum of
Jing Wu   +3 more
doaj   +1 more source

Sparsest Input Selection for Controllability of Singular Systems via a Two-Step Greedy Algorithm

open access: yesIEEE Access, 2020
In this paper, the problem of determining the sparsest input matrices to ensure controllability of linear singular systems is investigated. Firstly, it is shown that, determining the sparsest input matrices to ensure reachable controllability or complete
Yan Zhang, Wanhong Zhang
doaj   +1 more source

A family of matroid intersection algorithms for the computation of approximated symbolic network functions

open access: yes1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96, 2002
In recent years, the technique of simplification during generation has turned out to be very promising for the efficient computation of approximate symbolic network functions for large transistor circuits. In this paper it is shown how symbolic network functions can be simplified during their generation with any well-known symbolic network analysis ...
Wambacq, Piet   +4 more
openaire   +3 more sources

Approximation algorithm to symmetric alpha stable distribution with bi-region curve model

open access: yesTongxin xuebao, 2013
The symmetric alpha stable (S S) was used to model a non-Gaussian,heavy tail and impulsive noise of com-α munication channels.However,explicit expressions for the probability density functions (PDF) in terms of elementary functions are still unknown ...
Kang WANG, Zhi-jiang XU, Li-min MENG
doaj   +2 more sources

An optimal sequential algorithm for the uniform approximation of convex functions on [0,1]2 [PDF]

open access: yesApplied Mathematics & Optimization, 1983
In this paper an algorithm is given for the sequential selection ofN nodes (i.e., measurement points) for the uniform approximation (recovery) of convex functions over [0, 1]2, which has almost optimal order global error, (źc1Nź1lgN), over a naturally defined class of convex functions.
openaire   +3 more sources

Influence Activation Function in Approximate Periodic Functions Using Neural Networks

open access: yesIbn Al-Haitham Journal for Pure and Applied Sciences, 2017
The aim of this paper is to design fast neural networks to approximate periodic functions, that is, design a fully connected networks contains links between all nodes in adjacent layers which can speed up the approximation times, reduce approximation ...
Luma N. M. Tawfiq, Ala K. Jabber
doaj  

A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL

open access: yesBMC Bioinformatics, 2007
Background Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models.
Carlborg Örjan, Besnier Francois
doaj   +1 more source

Design of a Hybrid Ensemble Feature Selection Framework for Big Data Text Mining

open access: yesITEGAM-JETIA
The growing volume of textual data often exceeds the capacity of available computing resources, and conventional machine learning algorithms struggle to scale up.
Smah Smari   +2 more
doaj   +1 more source

A general quantum algorithm for numerical integration

open access: yesScientific Reports
Quantum algorithms have shown their superiority in many application fields. However, a general quantum algorithm for numerical integration, an indispensable tool for processing sophisticated science and engineering issues, is still missing.
Guoqiang Shu   +4 more
doaj   +1 more source

Laguerre-Based Frequency-Limited Balanced Truncation of Discrete-Time Systems

open access: yesMathematics
This paper introduces a novel model order reduction (MOR) method for linear discrete-time systems, focusing on frequency-limited balanced truncation (BT) techniques. By leveraging Laguerre functions, we develop two efficient MOR algorithms that avoid the
Zhou Song, Qiu-Yan Song, Umair Zulfiqar
doaj   +1 more source

Home - About - Disclaimer - Privacy