570 search results - page 102 / 114 » Approximating Some Network Design Problems with Node Costs |
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
OPODIS
2004
13 years 10 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
WECWIS
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
GECCO
2006
Springer
14 years 13 days ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...