Results 1 to 10 of about 17,015 (145)
Beware greedy algorithms. [PDF]
J Anim Ecol, 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 ...
Simmons BI, Hoeppke C, Sutherland WJ.
europepmc +4 more sources
Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. [PDF]
PLoS ONEIn the paper we consider the well-known Influence Maximization (IM) and Target Set Selection (TSS) problems for Boolean networks under Deterministic Linear Threshold Model (DLTM).
Alexander Andreev +2 more
doaj +2 more sources
A Comparison of Greedy Algorithm and Dynamic Programming Algorithm [PDF]
SHS Web of Conferences, 2022 Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances.
Chen Xiaoxi
doaj +1 more source
Improving Greedy Spanner Construction Algorithm [PDF]
Computer and Knowledge Engineering, 2023 In recent years, several algorithms with different time complexities have been proposed for the construction of greedy spanners. However, a not so apparently suitable algorithm with running time complexity , namely the FG algorithm, is proved to be ...
hosein salami, Mostafa Nouri Baygi
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
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
Algorithms, 2020 We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid ...
Jonathan Li +2 more
doaj +1 more source
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
Electronics Letters, 2023 Identifying cohesive subgraphs is an important topic in graph theory and complex network analysis. The quasi‐clique, as a generalization of clique, can be used to identify the functional and structural properties of various networks.
Jincheng Zhou, Shuhong Liu, Jian Gao
doaj +1 more source
Multi-greedy geographic packets forwarding using flow-based indicators [PDF]
EAI Endorsed Transactions on Mobile Communications and Applications, 2021 The MANET packet routing method of geographic greedy forwarding involves the selection of distance reducing intermediate relays towards a destination.
G. Oladeji-Atanda, D. Mpoeleng, F. Ogwu
doaj +1 more source
Conjugate Gradient Iterative Hard Thresholding for Structured Sparsity
IEEE Open Journal of Signal Processing, 2022 Greedy sparse recovery algorithms are studied in the structured sparsity (sparsity in levels) framework. Recovery guarantees are provided for Normalized Iterative Hard Thresholding and Conjugate Gradient Iterative Hard Thresholding in the form of ...
Jeffrey D. Blanchard
doaj +1 more source
Survey of 8 UAV Set-Covering Algorithms for Terrain Photogrammetry
Remote Sensing, 2020 Remote sensing with unmanned aerial vehicles (UAVs) facilitates photogrammetry for environmental and infrastructural monitoring. Models are created with less computational cost by reducing the number of photos required.
Joshua E. Hammond +8 more
doaj +1 more source