Results 21 to 30 of about 1,645,700 (287)

A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads

IEEE Access, 2021
The emergence of network function virtualization (NFV) has revolutionized the infrastructure and service management of network architecture. It allows network operators to reduce costs and improve the agility of network service deployment.
Chi-Chen Yang, Satyajit Padhy, Jerry Chou   +2 more
doaj   +1 more source

Improved Performance of Mean Greedy Algorithm for Chunk Allocation in SC-FDMA Uplink Systems using Joint-User and Chunk-Based Allocation

Journal of ICT Research and Applications, 2014
In this paper, the problem of subcarrier allocation on chunk-by-chunk basis in SC-FDMA uplink systems is investigated. Improved mean enhanced greedy algorithms are proposed for performing joint-user and chunk-based allocation at each transmission time ...
Arfianto Fahmi, Muhamad Asvial, Dadang Gunawan   +2 more
doaj   +1 more source

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

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, John E. Dorband, Milton Halem, Tim Finin   +3 more
openaire   +4 more sources

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   +4 more sources

Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation

Demonstratio Mathematica, 2022
Generalized approximate weak greedy algorithms (gAWGAs) were introduced by Galatenko and Livshits as a generalization of approximate weak greedy algorithms, which, in turn, generalize weak greedy algorithm and thus pure greedy algorithm.
Valiullin Artur R., Valiullin Albert R., Solodov Alexei P.   +2 more
doaj   +1 more source

Vector greedy algorithms

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   +3 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.
Rémi Gribonval, Morten Nielsen 0002
openaire   +4 more sources

Greedy Algorithms by Derandomizing Unknown Distributions [PDF]

, 1994
Greedy Algorithms by Derandomizing Unknown ...
Young, N.
core   +4 more sources

Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables

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