Sciweavers

137 search results - page 27 / 28
» Probabilistic algorithm for finding roots of linearized poly...
Sort
View
DM
2006
128views more  DM 2006»
13 years 5 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
SIAMSC
2008
140views more  SIAMSC 2008»
13 years 5 months ago
Newton-GMRES Preconditioning for Discontinuous Galerkin Discretizations of the Navier--Stokes Equations
We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier-Stokes equations. The spatial discreti...
Per-Olof Persson, Jaime Peraire
WWW
2009
ACM
14 years 5 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
WWW
2009
ACM
14 years 5 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
TCS
2010
12 years 12 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee