7930 search results - page 71 / 1586 » Greedy in Approximation Algorithms |
163
click to vote
UAI
2003
15 years 7 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
160
click to vote
EWC
2010
15 years 4 months ago
2010
Abstract This paper introduces a three-dimensional mesh generation algorithm for domains whose boundaries are curved surfaces, possibly with sharp features. The algorithm combines ...
200
click to vote
WADS
2009
Springer
16 years 22 days ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
171
click to vote
SCHEDULING
2010
15 years 4 months ago
2010
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
139
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...