Results 11 to 20 of about 1,645,700 (287)
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
openaire +4 more sources
Greedy algorithms: a review and open problems
Journal of Inequalities and ApplicationsGreedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms.
Andrea García
doaj +3 more sources
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
, 2015 Greedy algorithms seek to find optimal solutions by making locally optimal steps. They form a class of usually simple (simple from the point of view of both description and time complexity) algorithms which often return optimal solutions or have good ...
Moshkov, Mikhail
openaire +2 more sources
Reduced complexity schemes to greedy power allocation for multicarrier systems [PDF]
, 2010 Discrete bit loading for multicarrier systems based on the greedy power allocation (GPA) algorithm is considered in this paper. A new suboptimal scheme that independently performs GPA on groups of subcarriers and therefore can significantly reduce ...
Al-Hanafy, Waleed, Weiss, S.
core +7 more sources
Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path [PDF]
, 2021 The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem.
Syahputra, Dinur +5 more
core +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 +6 more sources
Suboptimal greedy power allocation schemes for discrete bit loading [PDF]
, 2013 In this paper we consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order.
Weiss, Stephan +1 more
core +3 more sources
A Greedy Hypercube-Labeling Algorithm [PDF]
The Computer Journal, 1992 Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms.
Bhagavathi, D. +2 more
openaire +5 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 introduced in [Y. Maday and J. Salomon, Joint Proceedings of the 48th IEEE Conference on Decision and Control and the 28th Chinese Control Conference, 2009, pp. 375--379] for operator reconstruction problems in the field of quantum mechanics.
Buchwald, Simon +2 more
openaire +4 more sources