12519 search results - page 138 / 2504 » Approximation Problems Categories |
138
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
137
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
159
click to vote
FLAIRS
2003
15 years 7 months ago
2003
This paper deals with the problem of merging descriptions of approximate spatial location specified at different levels of granularity. We distinguish between the roughness of an...
157
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
175
click to vote
MP
1998
15 years 6 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...