Rational approximation of discrete data with asymptomatic behaviour [PDF]
This thesis is concerned with the least-squares approximation of discrete data that appear to exhibit asymptotic behaviour. In particular, we consider using rational functions as they are able to display a number of types of asymptotic behaviour.
Cooper, Philip
core +4 more sources
Leveraging Sparse Approximation for Monaural Overlapped Speech Separation From Auditory Perspective
IEEE Access, 2023 Neuroscience suggests that the sparse behavior of a neural population underlies the mechanisms of the auditory system for monaural overlapped speech separation.
Hiroshi Sekiguchi +2 more
doaj +1 more source
Cost-effectiveness of algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Discrete ...
Graham Farr
doaj +1 more source
Unsupervised Attribute Reduction Algorithm for Mixed Data Based on Fuzzy Optimal Approximation Set
Mathematics, 2023 Fuzzy rough set theory has been successfully applied to many attribute reduction methods, in which the lower approximation set plays a pivotal role. However, the definition of lower approximation used has ignored the information conveyed by the upper ...
Haotong Wen, Shixin Zhao, Meishe Liang
doaj +1 more source
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem [PDF]
, 2006 We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1 + 2/e)-approximation algorithm of Chudak and Shmoys to obtain a new (1.6774,1.3738)- approximation algorithm for the UFL problem.
Byrka, Jaroslaw
core +3 more sources
An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]
, 2007 When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is NP-hard, even under very severe ...
Irving, R.W. +3 more
core +1 more source
Efficient Delivery Services Sharing with Time Windows
Applied Sciences, 2020 Delivery service sharing (DSS) has made an important contribution in the optimization of daily order delivery applications. Existing DSS algorithms introduce two major limitations.
Wanyuan Wang, Hansi Tao, Yichuan Jiang
doaj +1 more source
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
, 2009 Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +3 more
core +1 more source
Nonparametric Approximation Strategy Iteration Parallel Reinforcement Learning Algorithm [PDF]
Jisuanji gongcheng, 2018 To solve the problem of slow convergence speed of the online approximation strategy iteration reinforcement learning algorithm,a nonparametric approximation strategy iteration parallel reinforcement learning algorithm is proposed.The number of parallel ...
JI Ting,ZHANG Hua
doaj +1 more source
Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines
Sensors, 2021 As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environmental monitoring and data collection ...
Dieyan Liang, Hong Shen
doaj +1 more source