21 search results - page 1 / 5 » On the Starting and Stopping Problem: Application in Reversi... |
MOR
2007
13 years 4 months ago
2007
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
SIAMCO
2008
13 years 4 months ago
2008
This paper builds a new theoretical connection between singular control of finite variation and optimal switching problems. This correspondence provides a novel method for solving ...
MOR
2006
13 years 4 months ago
2006
Abstract. We solve the Poisson disorder problem when the delay is penalized exponentially. Our objective is to detect as quickly as possible the unobservable time of the change (or...
KBSE
2002
IEEE
13 years 9 months ago
2002
IEEE
Traditionally, an application has to be stopped to be adapted. This approach is not suitable for critical systems that have to be non-stop and highly available like bank, internet...