Sciweavers

3353 search results - page 318 / 671
» Laver and set theory
Sort
View
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
16 years 1 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann
PPDP
2009
Springer
16 years 1 months ago
Relational semantics for effect-based program transformations: higher-order store
We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Reď...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
SAGT
2009
Springer
176views Game Theory» more  SAGT 2009»
16 years 1 months ago
Bayesian Auctions with Friends and Foes
We study auctions whose bidders are embedded in a social or economic network. As a result, even bidders who do not win the auction themselves might derive utility from the auction,...
Po-An Chen, David Kempe
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
FOCS
2008
IEEE
16 years 1 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...