212 search results - page 29 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
141
click to vote
WECWIS
2005
IEEE
15 years 11 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...
166
click to vote
SAGA
2009
Springer
16 years 11 days ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
179
click to vote
IPCO
2007
15 years 7 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
180
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
169
click to vote
ICDM
2009
IEEE
16 years 15 days ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...