Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,372,867 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.
2012
2012
RNP-SA: Joint Relay Placement and Sub-Carrier Allocation in Wireless Communication Networks with Sustainable Energy
Zhongming Zheng
,
L. Cai
,
Ran Zhang
,
Xuemin Shen
IEEE Transactions on Wireless Communications
2012
Corpus ID: 1082118
Green energy is emerging as a promising alternative energy source to power network devices in next-generation wireless networks…
Expand
2011
2011
A Dynamic Ant Colony Based Routing Algorithm for Mobile Ad-hoc Networks
E. Khosrowshahi Asl
,
Majid Noorhosseini
,
Atieh Saberi Pirouz
Journal of information science and engineering
2011
Corpus ID: 6964380
In this paper we study the performance of ant colony based routing algorithms in mobile ad hoc networks (MANETs) and present SAMP…
Expand
2008
2008
Maximizing the area under the ROC curve by pairwise feature combination
C. Marroccoa
,
R. P. W. Duinb
,
F. Tortorellaa
2008
Corpus ID: 52218845
The majority of the available classification systems focus on the minimization of the classification error rate. This is not…
Expand
2007
2007
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
A. Ragone
,
T. D. Noia
,
E. di Sciascio
,
F. Donini
,
S. Colucci
,
Francesco Colasuonno
International Journal of Web Services Research
2007
Corpus ID: 16915379
We propose a framework and tractable algorithms for semantic-based automated Web service composition, fully compliant with…
Expand
2005
2005
Sampling-based soft equalization for frequency-selective MIMO channels
Bin Dong
,
Xiao-Dong Wang
IEEE Transactions on Communications
2005
Corpus ID: 37213042
We consider the problem of channel equalization in broadband wireless multiple-input multiple-output (MIMO) systems over…
Expand
2004
2004
CGGC: Cached Greedy Geocast
C. Maihöfer
,
R. Eberhardt
,
Elmar Schoch
Wired/Wireless Internet Communications
2004
Corpus ID: 9745558
With cached greedy geocast, we propose an enhanced forwarding scheme for geocast especially in highly mobile ad hoc networks. We…
Expand
1999
1999
Matroid and Greedy Algorithm
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…
Expand
1997
1997
Stability in adversarial queueing theory
P. Tsaparas
1997
Corpus ID: 18306742
A queueing network is a set of interconnected servers. Customers are injected continuously in the system, inducing some workload…
Expand
1988
1988
Lazy Data Routing And Greedy Scheduling For Application-specific Signal Processors
Ken Rimey
,
P. Hilfinger
Micro
1988
Corpus ID: 1234931
This paper concerns code generation for a troublesome class of horizontal-instruction-word architectures (whose machine language…
Expand
1980
1980
Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design
A. Kershenbaum
,
R. Boorstyn
,
Rosa Oppenheim
IEEE Transactions on Communications
1980
Corpus ID: 60731066
We consider the problem of designing a centralized telecommunication network comprised of multipoint lines given a set of…
Expand