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.
2012
2012
Green energy is emerging as a promising alternative energy source to power network devices in next-generation wireless networks… 
2011
2011
In this paper we study the performance of ant colony based routing algorithms in mobile ad hoc networks (MANETs) and present SAMP… 
2008
2008
The majority of the available classification systems focus on the minimization of the classification error rate. This is not… 
2007
2007
We propose a framework and tractable algorithms for semantic-based automated Web service composition, fully compliant with… 
2005
2005
We consider the problem of channel equalization in broadband wireless multiple-input multiple-output (MIMO) systems over… 
2004
2004
With cached greedy geocast, we propose an enhanced forwarding scheme for geocast especially in highly mobile ad hoc networks. We… 
1999
1999
  • Yi Zhu
  • 1999
  • Corpus ID: 123889043
The present paper deals with the equivalent conditions of the definition of matroid, gives out an inequality about the number of… 
1997
1997
A queueing network is a set of interconnected servers. Customers are injected continuously in the system, inducing some workload… 
1988
1988
This paper concerns code generation for a troublesome class of horizontal-instruction-word architectures (whose machine language… 
1980
1980
We consider the problem of designing a centralized telecommunication network comprised of multipoint lines given a set of…