Sciweavers

212 search results - page 29 / 43
» Competitive Online Approximation of the Optimal Search Ratio
Sort
View
WECWIS
2005
IEEE
94views ECommerce» more  WECWIS 2005»
14 years 1 months ago
Truthful Online Auctions for Pricing Peer-to-Peer Services
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...
Po-An Chen, Tyng-Ruey Chuang
SAGA
2009
Springer
14 years 2 months ago
Economical Caching with Stochastic Prices
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...
Matthias Englert, Berthold Vöcking, Melanie W...
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 9 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
Improved Randomized Results for That Interval Selection Problem
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...
Leah Epstein, Asaf Levin
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
14 years 2 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—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...
Zhuang Wang, Slobodan Vucetic