Results 31 to 40 of about 1,645,700 (287)
A new low-cost discrete bit loading using greedy power allocation [PDF]
, 2009 In this paper we consider a low cost bit loading based on the greedy power allocation (GPA). Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are suggested, which perform GPA on subsets ...
Alhanafy, W.E.A.E., Weiss, S.
core +2 more sources
Low-Complexity Multi-User Detection Based on Gradient Information for Uplink Grant-Free NOMA
IEEE Access, 2020 Massive machine type communication (mMTC) serves an irreplaceable role in the development process of the Internet of Things (IoT). Because of its characteristics of massive connection and sporadic transmission, compressed sensing (CS) has been applied in
Fang Jiang +4 more
doaj +1 more source
Complex System Modeling and Simulation, 2021 To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems. In this paper, we investigate the DPFSP by minimizing
Xue Han +7 more
doaj +1 more source
Dictionary Preconditioning for Greedy Algorithms [PDF]
IEEE Transactions on Signal Processing, 2008 This paper introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (orthogonal) matching pursuit which improves their performance in finding sparse signal representations in redundant dictionaries while maintaining the same complexity.
Karin Schnass, Pierre Vandergheynst
openaire +2 more sources
Algorithms with greedy heuristic procedures for mixture probability distribution separation [PDF]
Yugoslav Journal of Operations Research, 2019 For clustering problems based on the model of mixture probability distribution separation, we propose new Variable Neighbourhood Search algorithms (VNS) and evolutionary genetic algorithms (GA) with greedy agglomerative heuristic procedures and compare ...
Kazakovtsev Lev +3 more
doaj +1 more source
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
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +5 more
core +1 more source
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