Výsledky vyhľadávania - "Work Function Algorithm"

The K-server problem via a modern optimization lens Autor Bertsimas, Dimitris, Jaillet, Patrick, Korolko, Nikita

“…•We designed a new holistic algorithm that solves K-server problem more efficiently.•This algorithm incorporates both historical data and assumptions about the…”
Získať plný text

Online optimization with look-ahead for freeway emergency vehicle dispatching considering availability Autor Park, Hyoshin, Waddell, Deion, Haghani, Ali

“…•Online dispatching minimizing a sequence of emergency responses.•Network dependency with probability distribution of secondary incidents.•The lookahead online…”
Získať plný text

The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem Autor Sitters, René

“…The generalized 2-server problem is an online optimization problem where a sequence of requests has to be served at minimal cost. Requests arrive one by one…”
Získať plný text

The k-Server Problem with Parallel Requests and the Compound Work Function Algorithm Autor Hildenbrandt, R.

“…In this paper the compound work function algorithm for solving the generalized k-server problem is proposed. This problem is an online k-server problem with…”
Získať plný text

Asymptotically Optimal Online Page Migration on Three Points Autor Matsubayashi, Akira

“…This paper addresses the page migration problem: given online requests from nodes on a network for accessing a page stored in a node, output online migrations…”
Získať plný text

A new approach to solve the k-server problem based on network flows and flow cost reduction Autor Rudec, Tomislav, Manger, Robert

“…This paper is concerned with two algorithms for solving the k-server problem: the optimal off-line algorithm (OPT) and the on-line work function algorithm…”
Získať plný text

A fast approximate implementation of the work function algorithm for solving the k-server problem Autor Rudec, Tomislav, Manger, Robert

“…In this paper we propose an approximate implementation of the work function algorithm (WFA) for solving the k -server problem. Our implementation is based on…”
Získať plný text

A fast work function algorithm for solving the k-server problem Autor Rudec, Tomislav, Baumgartner, Alfonzo, Manger, Robert

“…This paper deals with the work function algorithm (WFA) for solving the on-line k -server problem. The paper addresses some practical aspects of the WFA, such…”
Získať plný text

Measuring True Performance of the Work Function Algorithm for Solving the On-line k-Server Problem Autor Rudec, Tomislav, Baumgartner, Alfonzo, Manger, Robert

“…This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. The paper is concerned with assessing actual performance of…”
Získať plný text

Topology matters: Smoothed competitiveness of metrical task systems Autor Schäfer, Guido, Sivadasan, Naveen

“…Borodin et al. (J. ACM 39 (1992) 745) introduced metrical task systems, a framework to model a large class of online problems. Metrical task systems can be…”
Získať plný text

Measuring true performance of the work function algorithm for solving the on-line k-server problem Autor Rudec, T, Baumgartner, A, Manger, R

“…This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. The paper is concerned with assessing actual performance of…”
Získať plný text

Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem Autor Baumgartner, Alfonzo, Manger, Robert, Hocenski, eljko

“…We consider a modification of the well known work function algorithm (WFA) for solving the on-line kserver problem. Our modified WFA is based on a moving…”
Získať plný text

On the Competitiveness of a Modified Work Function Algorithm for Solving the On-Line k-Server Problem Autor Rudec, T., Manger, R.

“…We study a modification of the well known work function algorithm (WFA) for solving the on-line k-server problem. Our modified WFA is based on a moving window,…”
Získať plný text

Work Function Algorithm with a Moving Window for Solving the On-Line k-Server Problem Autor Baumgartner, A., Manger, R., Hocenski, Z.

“…We consider a modification of the well known work function algorithm (WFA) for solving the on-line k -server problem. Our modified WFA is based on a moving…”
Získať plný text