Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,094,391 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.
2010
2010
Cost-Efficient Topology Design Problem in Time-Evolving Delay-Tolerant Networks
Minsu Huang
,
Siyuan Chen
,
Yingnan Zhu
,
Yu Wang
IEEE Global Telecommunications Conference…
2010
Corpus ID: 3259408
In this paper, we study the cost efficient topology design (CETD) problem in a predictable delay tolerant networks (DTN) where…
Expand
2010
2010
An Evolving-Construction Scheme for Fuzzy Systems
Di Wang
,
Xiao-Jun Zeng
,
J. Keane
IEEE transactions on fuzzy systems
2010
Corpus ID: 21173457
This paper proposes an evolving-construction scheme for fuzzy systems (ECSFS). ECSFS begins with a simple fuzzy system and…
Expand
Highly Cited
2007
Highly Cited
2007
Gossip along the way: order-optimal consensus through randomized path averaging
F. Bénézit
,
A. Dimakis
,
Patrick Thiran
,
M. Vetterli
2007
Corpus ID: 11352968
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for…
Expand
Highly Cited
2005
Highly Cited
2005
Distributed channel assignment protocols: a cross-layer approach [wireless ad hoc networks]
M. Gong
,
S. Midkiff
IEEE Wireless Communications and Networking…
2005
Corpus ID: 9914278
Despite being the subject of many years of research, distributed channel assignment remains a challenging problem. In this paper…
Expand
Highly Cited
2004
Highly Cited
2004
MM-Cubing: computing Iceberg cubes by factorizing the lattice space
Zheng Shao
,
Jiawei Han
,
Dong Xin
Proceedings. 16th International Conference on…
2004
Corpus ID: 874012
The data cube and iceberg cube computation problem has been studied by many researchers. There are three major approaches…
Expand
2004
2004
Segmentation and Tracking of Multiple Moving Objects for Intelligent Video Analysis
L.-Q. Xu
,
J. L. Landabaso
,
B. Lei
2004
Corpus ID: 16150598
This paper aims to address two of the key research issues in computer vision — the detection and tracking of multiple objects in…
Expand
Highly Cited
1999
Highly Cited
1999
Instruction Scheduling for TriMedia
J. Hoogerbrugge
,
L. Augusteijn
J. Instr. Level Parallelism
1999
Corpus ID: 12207169
Instruction scheduling is a crucial phase in a compiler for very long instruction word (VLIW) processors. This paper describes…
Expand
1999
1999
Randomization and super-heuristics in choosing sensor sets for target tracking applications
Lucy Y. PaoDepartment
Proceedings of the 38th IEEE Conference on…
1999
Corpus ID: 18130696
Surveillance systems tracking multiple targets often do not have the sensing or computational resources to apply all sensors to…
Expand
1999
1999
Matroid and Greedy Algorithm
Zhu Yi
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
Highly Cited
1986
Highly Cited
1986
A message passing framework for logical query evaluation
A. Van Gelder
ACM SIGMOD Conference
1986
Corpus ID: 15853197
We formulate the problem of query evaluatron over a relational database (EDB) supplemented by functronfree Horn clause rules (IDB…
Expand