Results 31 to 40 of about 138,670 (265)
Drones Routing with Stochastic Demand
Drones, 2023 Motivated by the increasing number of drones used for package delivery, we first study the problem of Multiple drOne collaborative Routing dEsign (MORE) in this article. That is, given a fixed number of drones and customers, determining the delivery trip
Nan Yu +6 more
doaj +1 more source
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
Mathematics, 2020 In this paper, we study the submodular load balancing problem with submodular penalties. The objective of this problem is to balance the load among sets, while some elements can be rejected by paying some penalties. Officially, given an element set V, we
Xiaofei Liu, Peiyin Xing, Weidong Li
doaj +1 more source
IEEE Access, 2020 Owing to the flexibility and low cost, cooperative Unmanned Aerial Vehicles(UAVs) have been attractive in multi-target positioning recently. Although it is popular and easy to accomplish, positioning based on trilateration method still faces challenges ...
Yao Ji, Chao Dong, Xiaojun Zhu, Qihui Wu
doaj +1 more source
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
Approximation Algorithms for $\ell_0$-Low Rank Approximation
CoRR, 2017 We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes the number of its non-zero entries.
Bringmann, K. ; https://orcid.org/0000-0003-1356-5177 +2 more
openaire +4 more sources
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Rémi Gribonval, Morten Nielsen 0002
openaire +3 more sources
Approximate Discrete Reconstruction Algorithm [PDF]
Fundamenta Informaticae, 2013 Discrete tomography deals with tomographic reconstruction of greyscale images for which the set of possible grey levels is discrete and small. Here, we develop a discrete approximate reconstruction algorithm. Our algorithm computes an image that has only grey values belonging to a given finite set.
K.J. Batenburg (Joost) +2 more
openaire +4 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 +3 more sources
Approximation Algorithms for Scheduling with Reservations
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +3 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source