Sciweavers

227 search results - page 14 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
FOCS
2004
IEEE
14 years 5 days ago
Optimal Power-Down Strategies
We consider the problem of selecting threshold times to transition a device to low-power sleep states during an idle period. The two-state case in which there is a single active a...
John Augustine, Sandy Irani, Chaitanya Swamy
DISOPT
2008
89views more  DISOPT 2008»
13 years 8 months ago
A pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
Oktay Günlük
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
14 years 8 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
CEC
2010
IEEE
13 years 6 months ago
Beating the 'world champion' evolutionary algorithm via REVAC tuning
Abstract-- We present a case study demonstrating that using the REVAC parameter tuning method we can greatly improve the `world champion' EA (the winner of the CEC2005 competi...
Selmar K. Smit, A. E. Eiben
ICONIP
2007
13 years 10 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor