Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,375,112 papers from all fields of science
Search
Sign In
Create Free Account
Greedy algorithm
Known as:
Greedy method
, Greedy algorithms
, Greedy heuristic
Expand
A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithm design
Antimatroid
Best-first search
Brown clustering
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
A location-aided routing protocol for cognitive radio networks
Karim Habak
,
Mohammed Abdelatif
,
Hazem Hagrass
,
Karim Rizc
,
M. Youssef
International Conference on Computing, Networking…
2013
Corpus ID: 16418424
Multi-hop cognitive radio networks (CRNs) are gaining interest recently in many practical applications. With location information…
Expand
Highly Cited
2009
Highly Cited
2009
Analysis of per-node traffic load in multi-hop wireless sensor networks
Q. Chen
,
S. Kanhere
,
Mahbub Hassan
IEEE Transactions on Wireless Communications
2009
Corpus ID: 13149215
The energy expended by sensor nodes in data communication makes up a significant quantum of their total energy consumption…
Expand
2009
2009
Scheduling in Flowshops with No-Idle Machines
Rubén Ruiz
,
Eva Vallada
,
Carlos Fernández-Martínez
2009
Corpus ID: 55317599
This chapter deals with an interesting and not so well studied variant of the classical permutation flowshop problem with…
Expand
Highly Cited
2007
Highly Cited
2007
Multiuser MIMO Downlink Made Practical: Achievable Rates with Simple Channel State Estimation and Feedback Schemes
G. Caire
,
N. Jindal
,
M. Kobayashi
,
Niranjay Ravindran
arXiv.org
2007
Corpus ID: 12054760
We consider a MIMO fading broadcast channel and compute achievable ergodic rates when channel state information is acquired at…
Expand
Highly Cited
2004
Highly Cited
2004
Combination of hidden Markov models with dynamic time warping for speech recognition
S. Axelrod
,
B. Maison
IEEE International Conference on Acoustics…
2004
Corpus ID: 16440025
We combine hidden Markov models of various topologies and nearest neighbor classification techniques in an exponential modeling…
Expand
Highly Cited
2003
Highly Cited
2003
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
A. Shmygelska
,
H. Hoos
Canadian Conference on AI
2003
Corpus ID: 9759455
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational…
Expand
Highly Cited
2002
Highly Cited
2002
A note on the minimum label spanning tree
Y. Wan
,
Guoliang Chen
,
Yinlong Xu
Information Processing Letters
2002
Corpus ID: 2898098
Highly Cited
1998
Highly Cited
1998
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors
Jie Wu
IEEE Trans. Parallel Distributed Syst.
1998
Corpus ID: 12941596
Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach…
Expand
Highly Cited
1995
Highly Cited
1995
Loading Multiple Pallets
E. E. Bischoff
,
M. Ratcliff
1995
Corpus ID: 62710721
This paper addresses the problem of loading pallets with non-identical items, i.e. what has been called the ‘Distributor's Pallet…
Expand
Highly Cited
1994
Highly Cited
1994
An observation-based admission control algorithm for multimedia servers
H. Vin
,
A. Goyal
,
Anshuman Goyal
,
P. Goyal
Proceedings of IEEE International Conference on…
1994
Corpus ID: 15182362
Proposes a novel observation-based admission control algorithm, in which a client is admitted for service by a multimedia server…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE