Results 11 to 20 of about 33,631 (264)
OTA testing of near‐field and far‐field communication links
Electronics Letters, 2023 In this work, near‐field and far‐field link measurement in metal enclosure environment is performed. The performance of near‐field and far‐field links are assessed using key performance indicators such as error vector magnitude, bit error rate, and ...
B. Korunur Engiz +3 more
doaj +1 more source
EAI Endorsed Transactions on Mobile Communications and Applications, 2022 Characterizing the topology of MANETs provides the means for packet routing protocols to perform adaptively and efficiently in the particular environments.
G. Oladeji-Atanda, D. Mpoeleng
doaj +1 more source
Algorithmica, 2017 Algorithmica 80(4), 1298 - 1314 (2018).
Faigle, Ulrich +2 more
openaire +4 more sources
Beware greedy algorithms [PDF]
Journal of Animal Ecology, 2019 Nestedness – the tendency for specialist species to interact with subsets of the species that generalist species interact with – is a pervasive feature of empirical mutualistic communities (Bascompte, Jordano, Melián, & Olesen, 2003). While theoretical work has discovered important dynamical implications of nestedness, such as enhanced community ...
Benno I. Simmons +2 more
openaire +2 more sources
Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm
Mathematics, 2023 We first study the error performances of the Vector Weak Rescaled Pure Greedy Algorithm for simultaneous approximation with respect to a dictionary D in a Hilbert space.
Xu Xu +3 more
doaj +1 more source
Contrasting of Various Algorithmic Techniques to Solve Knapsack 0-1 Problem
JOIV: International Journal on Informatics Visualization, 2020 This paper will point of convergence on a relative assessment and estimation of the dynamic programming, B&B, Greedy and Genetic algorithm including of the intricacy of time prerequisites, and the necessary programming endeavors and inspect the absolute ...
Yogesh Awasthi, Ashish Sharma
doaj +1 more source
A New Greedy Algorithm for the Curriculum-based Course Timetabling Problem
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2023 This study describes a novel greedy algorithm for optimizing the well-known Curriculum-Based Course Timetabling (CB-CTT) problem. Greedy algorithms are a good alternative to brute-force and evolutionary algorithms, which take a long time to execute in ...
Tansel Dökeroğlu +2 more
doaj +1 more source
Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization
IEEE Access, 2021 The problem of selecting an optimal set of sensors estimating a high-dimensional data is considered. Objective functions based on D-, A-, and E-optimality criteria of optimal design are adopted to greedy methods, that maximize the determinant, minimize ...
Kumi Nakai +4 more
doaj +1 more source
Proceedings. IEEE International Symposium on Information Theory, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brualdi, Richard A, Pless, Vera S
openaire +1 more source
Greedy Rectilinear Drawings [PDF]
Theoretical Computer Science, 2018 A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing
Patrizio Angelini +8 more
openaire +5 more sources