Results 31 to 40 of about 17,784 (258)
On performance of greedy algorithms
Journal of Approximation Theory, 2011 Let \(H\) be a Hilbert space and \(\mathcal{D}:=\{\varphi_{i}:i\in\mathbb{N} \}\subset H\) be such that \(\overline{\text{span}\mathcal{D}}\mathcal{=}H.\) A dictionary \(\mathcal{D}\) is called \(M\)-coherent if its coherence, defined by \(\sup\{|| :\varphi,\psi\in\mathcal{D}, \varphi\neq\psi\}\) is exactly \(M.\) The authors consider the Orthogonal ...
Vladimir N. Temlyakov, Pavel Zheltov
openaire +1 more source
Methods for Distributed Compressed Sensing
Journal of Sensor and Actuator Networks, 2013 Compressed sensing is a thriving research field covering a class of problems where a large sparse signal is reconstructed from a few random measurements.
Dennis Sundman +2 more
doaj +1 more source
The Online Reservation Problem
Algorithms, 2020 Many sharing-economy platforms operate as follows. Owners list the availability of resources, prices, and contract-length limits. Customers propose contract start times and lengths. The owners decide immediately whether to accept or decline each proposal,
Shashank Goyal, Diwakar Gupta
doaj +1 more source
A framework for the greedy algorithm
Discrete Applied Mathematics, 2002 Matroids are characterized by the fact that the greedy algorithm finds bases of largest weight. There are, however, optimization problems for which the greedy algorithm solves the optimization problem for many, but not all, linear weight functions and for such situations a theory is developed to efficiently identify instances on which the greedy ...
Department of Mathematics, University of Florida Little Hall, PO Box 118105, Gainesville, FL 32611-8105, USA ( host institution ) +1 more
openaire +2 more sources
Lebesgue constants for Chebyshev thresholding greedy algorithms
Journal of Inequalities and Applications, 2018 We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an n-term approximation with respect to general bases in a Banach space. We show that the convergence property of CTGA is better than TGA for non-quasi-greedy bases. Then
Chunfang Shao, Peixin Ye
doaj +1 more source
On the Automated and Reactive Optimization of Highly-Dynamic Communication Network Infrastructures [PDF]
Journal of Universal Computer Science, 2019 In this paper, the applicability of heuristic methods for an automated and reactive optimization of network infrastructures in highly-dynamic communication networks is studied.
Robin Mueller-Bady +3 more
doaj +3 more sources
Image reconstruction algorithm based on variable atomic number matching pursuit
Journal of Algorithms & Computational Technology, 2017 As the most critical part of compressive sensing theory, reconstruction algorithm has an impact on the quality and speed of image reconstruction. After studying some existing convex optimization algorithms and greedy algorithms, we find that convex ...
Hongtu Zhao, Chong Chen, Chenxu Shi
doaj +1 more source
The weighted property (A) and the greedy algorithm
Journal of Approximation Theory, 2019 We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy and w-partially-greedy bases, and show some properties of w-semi-greedy bases. To achieve these goals, we introduce and study the w-Property (A).
Pablo M. Berná +4 more
openaire +3 more sources
Greedy algorithms: a review and open problems
Journal of Inequalities and ApplicationsGreedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms.
Andrea García
doaj +1 more source
Algorithms, 2019 In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle.
Napoleão Nepomuceno +2 more
doaj +1 more source