Sciweavers

7133 search results - page 8 / 1427
» Communication algorithms with advice
Sort
View
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 11 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
ACMICEC
2006
ACM
142views ECommerce» more  ACMICEC 2006»
14 years 1 months ago
Trusting advice from other buyers in e-marketplaces: the problem of unfair ratings
In electronic marketplaces populated by self-interested agents, buyer agents would benefit by modeling the reputation of seller agents, in order to make effective decisions abou...
Jie Zhang, Robin Cohen
ORL
2010
108views more  ORL 2010»
13 years 2 months ago
Weak aggregating algorithm for the distribution-free perishable inventory problem
Abstract. We formulate the multiperiod, distribution-free perishable inventory problem as a problem of prediction with expert advice and apply an online learning method (the Weak A...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...
SIGCOMM
2003
ACM
14 years 21 days ago
A knowledge plane for the internet
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as re...
David D. Clark, Craig Partridge, J. Christopher Ra...
SODA
2012
ACM
199views Algorithms» more  SODA 2012»
11 years 10 months ago
On the communication and streaming complexity of maximum bipartite matching
Ashish Goel, Michael Kapralov, Sanjeev Khanna