7930 search results - page 98 / 1586 » Greedy in Approximation Algorithms |
171
click to vote
CIAC
2000
Springer
15 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
142
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
172
click to vote
ESA
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
141
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
175
click to vote
SIAMCO
2002
15 years 5 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...