3096 search results - page 399 / 620 » The Generalized FITC Approximation |
181
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
165
click to vote
AAAI
2000
15 years 7 months ago
2000
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
172
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
189
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
159
click to vote
COR
2008
15 years 6 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...