Results 21 to 30 of about 138,670 (265)
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
Algorithmic approaches for network design with facility location: A survey [PDF]
AUT Journal of Mathematics and Computing, 2022 We consider a family of problems that combine network design and facility location. Such problems arise in many practical applications in different fields such as telecommunications, transportation networks, logistic, and energy supply networks.
Mohsen Rezapour
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 +2 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
NORA: An Approach for Transforming Network Management Policies into Automated Planning Problems
Sensors, 2021 Realizing autonomic management control loops is pivotal for achieving self-driving networks. Some studies have recently evidence the feasibility of using Automated Planning (AP) to carry out these loops. However, in practice, the use of AP is complicated
Angela Rodriguez-Vivas +4 more
doaj +1 more source
A Primal–Dual-Based Power Control Approach for Capacitated Edge Servers
Sensors, 2022 The intensity of radio waves decays rapidly with increasing propagation distance, and an edge server’s antenna needs more power to form a larger signal coverage area.
Qinghui Zhang +3 more
doaj +1 more source
An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
Computation, 2022 In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty function π:2U→R+ on the plane, the relationship that adjusts the power p(s) of each sensor s and its ...
Han Dai
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 +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
On Strong Convergence of Halpern’s Method for Quasi-Nonexpansive Mappings in Hilbert Spaces
Mathematical Modelling and Analysis, 2016 In this paper, we introduce a Halpern’s type method to approximate common fixed points of a nonexpansive mapping T and a strongly quasi-nonexpansive mappings S, defined in a Hilbert space, such that I − S is demiclosed at 0.
Jesus Garcia Falset +3 more
doaj +1 more source