Results 1 to 10 of about 17,784 (258)
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 +3 more sources
Distributed greedy pursuit algorithms [PDF]
Signal Processing, 2014 For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes.
Dennis Sundman +2 more
exaly +3 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 +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.
V N Temlyakov
exaly +4 more sources
Greedy algorithms for nonnegativity-constrained simultaneous sparse recovery [PDF]
Signal Processing, 2016 Daeun Kim, Justin P Haldar
exaly +2 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
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