7930 search results - page 239 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
EVOW
2004
Springer
15 years 12 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
154
click to vote
AIPS
2010
15 years 8 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
138
click to vote
IJCAI
1993
15 years 7 months ago
1993
This paper presents a major revision of the Either propositional theory re nement system. Two issues are discussed. First, we show howrun timee ciency can be greatlyimproved by ch...
230
click to vote
SIAMSC
2010
15 years 4 months ago
2010
A greedy algorithm for the construction of a reduced model with reduction in both parameter and state is developed for efficient solution of statistical inverse problems governed b...
258
click to vote
TELSYS
2011
15 years 1 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...