7930 search results - page 67 / 1586 » Greedy in Approximation Algorithms |
93
Voted
NIPS
2004
15 years 4 months ago
2004
We propose a "soft greedy" learning algorithm for building small conjunctions of simple threshold functions, called rays, defined on single real-valued attributes. We al...
105
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
94
Voted
MOBIHOC
2009
ACM
16 years 3 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
141
Voted
JCO
1998
15 years 2 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
106
Voted
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...