Sciweavers

563 search results - page 54 / 113
» Computing approximate PSD factorizations
Sort
View
ICCSA
2005
Springer
14 years 3 months ago
Comparison of Global Optimization Methods for Drag Reduction in the Automotive Industry
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
Laurent Dumas, Vincent Herbert, Frédé...
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
DIS
2004
Springer
14 years 3 months ago
Tiling Databases
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
Floris Geerts, Bart Goethals, Taneli Mielikäi...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 3 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...