Results 31 to 40 of about 2,913,313 (303)
Applied Sciences, 2019 The Expanded Douglas⁻Peucker (EDP) polygonal approximation algorithm and its application method for the Opposite Angle-Based Exact Cell Decomposition (OAECD) are proposed for the mobile robot path-planning problem with curvilinear obstacles.
Jin-Woo Jung +4 more
doaj +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
Algorithms For Positive Polynomial Approximation [PDF]
SIAM Journal on Numerical Analysis, 2019 Summary: We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions. Our method is based on the special representations
Charles, Frédérique +2 more
openaire +3 more sources
Approximation Algorithms for Aligning Points [PDF]
Algorithmica, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Cabello, Marc J. van Kreveld
openaire +4 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
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 +4 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
All-norm approximation algorithms [PDF]
Journal of Algorithms, 2002 Summary: A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different \(\ell_p\) norms. We address this problem by introducing the concept of an all-norm \(\rho\)-approximation algorithm, which supplies one ...
Yossi Azar +3 more
openaire +6 more sources
Approximation Algorithms for Intersection Graphs [PDF]
Algorithmica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Kammer, Torsten Tholey
openaire +5 more sources
Efficient Subspace Approximation Algorithms [PDF]
Discrete & Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nariankadu D. Shyamalkumar +1 more
openaire +2 more sources