Results 21 to 30 of about 17,784 (258)
On the greedy algorithm for satisfiability
Information Processing Letters, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koutsoupias, E, Papadimitriou, C
openaire +3 more sources
Analysis of a Greedy Reconstruction Algorithm [PDF]
SIAM Journal on Control and Optimization, 2021 A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition of the reconstruction process and on an ansatz for the unknown operator obtained by an a priori chosen set of ...
Buchwald, Simon +2 more
openaire +3 more sources
The Feature Compression Algorithms for Identifying Cytokines Based on CNT Features
IEEE Access, 2020 As the signaling proteins, cytokines regulate a wide range of biological functions. It is important to distinguish the cytokines from other kinds of proteins.
Guilin Li, Xing Gao
doaj +1 more source
Journal of Complexity, 2003 A dictionary is a subset \(\mathcal D\) of a Hilbert space \((H,\langle\cdot,\cdot\rangle)\) such that \(\|g\|=1\) for all \(g\in \mathcal D\) and cl-span\((\mathcal D)=H.\) The objective of greedy algorithms is to construct a sequence \(\{g_k\}\) in \(\mathcal D\) and a sequence of approximants \(G_k\in\mathcal D_k=\) span\(\{g_1,\dots,g_k\}\) such ...
Adam Lutoborski, Vladimir N. Temlyakov
openaire +2 more sources
Entropy, 2023 In this research, we consider decision trees that incorporate standard queries with one feature per query as well as hypotheses consisting of all features’ values.
Mohammad Azad, Mikhail Moshkov
doaj +1 more source
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
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
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
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)
Ramin Ayanzadeh +3 more
openaire +3 more sources