Sciweavers

1057 search results - page 162 / 212
» Peer-to-Peer utility maximization
Sort
View
DKE
2008
106views more  DKE 2008»
14 years 9 months ago
Towards optimal k-anonymization
When releasing microdata for research purposes, one needs to preserve the privacy of respondents while maximizing data utility. An approach that has been studied extensively in re...
Tiancheng Li, Ninghui Li
EOR
2008
70views more  EOR 2008»
14 years 9 months ago
Robust portfolio selection based on a multi-stage scenario tree
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
Ruijun Shen, Shuzhong Zhang
FGCS
2008
135views more  FGCS 2008»
14 years 9 months ago
An on-line replication strategy to increase availability in Data Grids
Data is typically replicated in a Data Grid to improve the job response time and data availability. Strategies for data replication in a Data Grid have previously been proposed, b...
Ming Lei, Susan V. Vrbsky, Xiaoyan Hong
CCR
2006
82views more  CCR 2006»
14 years 9 months ago
Why flow-completion time is the right metric for congestion control
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
Nandita Dukkipati, Nick McKeown
ECCC
2006
218views more  ECCC 2006»
14 years 9 months ago
Efficient Algorithms for Online Game Playing and Universal Portfolio Management
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
Amit Agarwal, Elad Hazan