227 search results - page 14 / 46 » A Competitive Algorithm for the General 2-Server Problem |
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
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...
113
click to vote
DISOPT
2008
14 years 11 months ago
2008
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...
80
Voted
STOC
2003
ACM
15 years 12 months ago
2003
ACM
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...
CEC
2010
IEEE
14 years 9 months ago
2010
IEEE
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...
ICONIP
2007
15 years 1 months ago
2007
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...