Sciweavers

1429 search results - page 136 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
WWW
2008
ACM
14 years 9 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
ISICA
2007
Springer
14 years 3 months ago
On the Performance of Metamodel Assisted MOEA/D
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
Wudong Liu, Qingfu Zhang, Edward P. K. Tsang, Cao ...
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 4 months ago
On optimal cooperative patrolling
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 23 days ago
Inside a predator-prey model for multi-objective optimization: a second study
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...
Christian Grimme, Karlheinz Schmitt