Results 21 to 30 of about 17,132 (259)
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
Quantum-Assisted Greedy Algorithms
IGARSS 2022 - 2022 IEEE International Geoscience and Remote Sensing Symposium, 2022 Proceedings of the International Geoscience and Remote Sensing Symposium (IGARSS)
Ayanzadeh, Ramin +3 more
openaire +3 more sources
Super greedy type algorithms [PDF]
Advances in Computational Mathematics, 2011 We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The idea of picking several elements at a greedy step of the algorithm is not new.
Liu, Entao, Temlyakov, Vladimir N.
openaire +3 more sources
Greedy algorithms in Datalog [PDF]
Theory and Practice of Logic Programming, 2001 In the design of algorithms, the greedy paradigm provides a powerful tool for solving efficiently classical computational problems, within the framework of procedural languages. However, expressing these algorithms within the declarative framework of logic-based languages has proven a difficult research challenge.
GRECO, Sergio, ZANIOLO C.
openaire +4 more sources
On the Rate of Convergence of Greedy Algorithms
Mathematics, 2023 In this paper, a new criterion for the evaluation of the theoretical efficiency of a greedy algorithm is suggested. Using this criterion, we prove some results on the rate of convergence of greedy algorithms, which provide expansions.
Vladimir Temlyakov
doaj +1 more source
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.
Gribonval, Rémi, Nielsen, Morten
openaire +3 more sources
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
Fast greedy triangulation algorithms [PDF]
Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dickerson, Matthew T. +3 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