Results 21 to 30 of about 151,397 (266)
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
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
Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search are Related [PDF]
, 2015 This paper considers a recently emerged hyperspectral unmixing formulation based on sparse regression of a self-dictionary multiple measurement vector (SD-MMV) model, wherein the measured hyperspectral pixels are used as the dictionary.
Bioucas-Dias, José M. +3 more
core +2 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.
Gribonval, Rémi, Nielsen, Morten
openaire +3 more sources
Collapsing Superstring Conjecture [PDF]
, 2019 In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits 2 11/23-approximation in polynomial time (Mucha, SODA\u2713).
Golovnev, Alexander +4 more
core +2 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