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)

Related topics

Related topics

50 relations
Algorithm designAntimatroidBest-first searchBrown clustering

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
Multi-hop cognitive radio networks (CRNs) are gaining interest recently in many practical applications. With location information… 
Highly Cited
2011
Highly Cited
2011
A Realistic Small-World Model for Wireless Mesh Networks
Small-world network concept deals with the addition of a few Long-ranged Links (LLs) to significantly bring down the average path… 
Highly Cited
2009
Highly Cited
2009
Deep Convolutional Networks for Scene Parsing
We propose a deep learning strategy for scene parsing, i.e. to asssign a class label to each pixel of an image. We investigate… 
Highly Cited
2009
Highly Cited
2009
Analysis of per-node traffic load in multi-hop wireless sensor networks
The energy expended by sensor nodes in data communication makes up a significant quantum of their total energy consumption… 
Highly Cited
2004
Highly Cited
2004
Combination of hidden Markov models with dynamic time warping for speech recognition
We combine hidden Markov models of various topologies and nearest neighbor classification techniques in an exponential modeling… 
Highly Cited
2004
Highly Cited
2004
MM-Cubing: computing Iceberg cubes by factorizing the lattice space
The data cube and iceberg cube computation problem has been studied by many researchers. There are three major approaches… 
Highly Cited
2003
Highly Cited
2003
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational… 
Highly Cited
2002
Highly Cited
2002
Budgeted learning of nailve-bayes classifiers
There is almost always a cost associated with acquiring training data. We consider the situation where the learner, with a fixed… 
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… 
Highly Cited
1995
Highly Cited
1995
Loading Multiple Pallets
This paper addresses the problem of loading pallets with non-identical items, i.e. what has been called the ‘Distributor's Pallet… 
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)