Skip to search formSkip to main contentSkip to account menu

Greedy algorithm

Known as: Greedy method, Greedy algorithms, Greedy heuristic 
A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Multi-hop cognitive radio networks (CRNs) are gaining interest recently in many practical applications. With location information… 
Highly Cited
2009
Highly Cited
2009
The energy expended by sensor nodes in data communication makes up a significant quantum of their total energy consumption… 
2009
2009
This chapter deals with an interesting and not so well studied variant of the classical permutation flowshop problem with… 
Highly Cited
2007
Highly Cited
2007
We consider a MIMO fading broadcast channel and compute achievable ergodic rates when channel state information is acquired at… 
Highly Cited
2004
Highly Cited
2004
We combine hidden Markov models of various topologies and nearest neighbor classification techniques in an exponential modeling… 
Highly Cited
2003
Highly Cited
2003
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational… 
Highly Cited
1998
Highly Cited
1998
  • Jie Wu
  • 1998
  • Corpus ID: 12941596
Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach… 
Highly Cited
1995
Highly Cited
1995
This paper addresses the problem of loading pallets with non-identical items, i.e. what has been called the ‘Distributor's Pallet… 
Highly Cited
1994
Highly Cited
1994
Proposes a novel observation-based admission control algorithm, in which a client is admitted for service by a multimedia server…