7930 search results - page 552 / 1586 » Greedy in Approximation Algorithms |
188
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
189
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
222
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
177
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
174
click to vote
ICALP
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...