Výsledky vyhledávání - "Work function algorithm"
-
1
The work function algorithm for the paging problem
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 21.09.2022Vydáno v Theoretical computer science (21.09.2022)“…The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults in a two-level store. It is a…”
Získat plný text
Journal Article -
2
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2014Vydáno v SIAM journal on computing (01.01.2014)“…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ískat plný text
Journal Article -
3
A new upper bound on the work function algorithm for the k-server problem
ISSN: 1382-6905, 1573-2886Vydáno: New York Springer US 01.02.2020Vydáno v Journal of combinatorial optimization (01.02.2020)“…) showed that the work function algorithm ( WFA ) has a competitive ratio of at most 2 k - 1 for the k -server problem…”
Získat plný text
Journal Article -
4
A fast approximate implementation of the work function algorithm for solving the -server problem
ISSN: 1435-246X, 1613-9178Vydáno: Heidelberg Springer 01.09.2015Vydáno v Central European journal of operations research (01.09.2015)“…In this paper we propose an approximate implementation of the work function algorithm (WFA) for solving the [Formula omitted]-server problem…”
Získat plný text
Journal Article -
5
The k-Server Problem with Parallel Requests and the Compound Work Function Algorithm
ISSN: 2255-8950, 2255-8942, 2255-8950Vydáno: Riga University of Latvia 2020Vydáno v Baltic Journal of Modern Computing (2020)“…In this paper the compound work function algorithm for solving the generalized k-server problem is proposed…”
Získat plný text
Journal Article -
6
On the competitive ratio of the work function algorithm for the k-server problem
ISSN: 0304-3975, 1879-2294Vydáno: Amsterdam Elsevier B.V 20.09.2004Vydáno v Theoretical computer science (20.09.2004)“… The conjecture has been open for over 15 years. The top candidate online algorithm for settling this conjecture is the work function algorithm ( WFA…”
Získat plný text
Journal Article -
7
A fast approximate implementation of the work function algorithm for solving the k-server problem
ISSN: 1435-246X, 1613-9178Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2015Vydáno v Central European journal of operations research (01.09.2015)“…In this paper we propose an approximate implementation of the work function algorithm (WFA…”
Získat plný text
Journal Article -
8
A fast work function algorithm for solving the k-server problem
ISSN: 1435-246X, 1613-9178Vydáno: Berlin/Heidelberg Springer-Verlag 01.01.2013Vydáno v Central European journal of operations research (01.01.2013)“…This paper deals with the work function algorithm (WFA) for solving the on-line k -server problem…”
Získat plný text
Journal Article -
9
A fast approximate implementation of the work function algorithm for solving the $$k$$ k -server problem
ISSN: 1435-246X, 1613-9178Vydáno: 01.09.2015Vydáno v Central European journal of operations research (01.09.2015)Získat plný text
Journal Article -
10
On the additive constant of the k-server Work Function Algorithm
ISSN: 0020-0190, 1872-6119Vydáno: Amsterdam Elsevier B.V 30.11.2010Vydáno v Information processing letters (30.11.2010)“…We consider the Work Function Algorithm for the k-server problem (Chrobak and Larmore, 1991…”
Získat plný text
Journal Article -
11
The K-server problem via a modern optimization lens
ISSN: 0377-2217, 1872-6860Vydáno: Elsevier B.V 01.07.2019Vydáno v European journal of operational research (01.07.2019)“…•We designed a new holistic algorithm that solves K-server problem more efficiently.•This algorithm incorporates both historical data and assumptions about the…”
Získat plný text
Journal Article -
12
Online optimization with look-ahead for freeway emergency vehicle dispatching considering availability
ISSN: 0968-090X, 1879-2359Vydáno: United Kingdom Elsevier Ltd 01.12.2019Vydáno v Transportation research. Part C, Emerging technologies (01.12.2019)“…•Online dispatching minimizing a sequence of emergency responses.•Network dependency with probability distribution of secondary incidents.•The lookahead online…”
Získat plný text
Journal Article -
13
Measuring True Performance of the Work Function Algorithm for Solving the On-line k-Server Problem
ISSN: 1330-1136, 1846-3908Vydáno: Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu 2010Vydáno v Journal of computing and information technology (2010)“…This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem…”
Získat plný text
Journal Article Paper -
14
Measuring True Performance of the Work Function Algorithm for Solving the On-line k-Server Problem: Special Issue based on the best papers at the 2010 annual conference International Conference on Information Technology Interfaces (ITI)
ISSN: 1330-1136Vydáno: Zagreb University Computing Centre 2010Vydáno v Journal of computing and information technology (2010)Získat plný text
Journal Article -
15
Measuring true performance of the work function algorithm for solving the on-line k-server problem
ISBN: 9781424457328, 1424457327ISSN: 1330-1012Vydáno: IEEE 01.06.2010Vydáno v Proceedings of the ITI 2010, 32nd International Conference on Information Technology Interfaces : 21-24 June 2010 (01.06.2010)“…This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem…”
Získat plný text
Konferenční příspěvek -
16
Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem
ISSN: 1330-1136, 1846-3908Vydáno: Zagreb University Computing Centre 01.12.2007Vydáno v Journal of computing and information technology (01.12.2007)“…We consider a modification of the well known work function algorithm (WFA) for solving the on-line kserver problem…”
Získat plný text
Journal Article Konferenční příspěvek Paper -
17
Work Function Algorithm with a Moving Window for Solving the On-Line k-Server Problem
ISBN: 9537138097, 9789537138097ISSN: 1330-1012Vydáno: Zagreb IEEE 01.06.2007Vydáno v Proceedings of the ITI 2007 : 29th International Conference on Information Technology Interfaces : ITI 2007 : June 25-28, 2007, Cavtat/Dubrovnik, Croatia (01.06.2007)“…We consider a modification of the well known work function algorithm (WFA) for solving the on-line k -server problem…”
Získat plný text
Konferenční příspěvek -
18
On the Competitiveness of a Modified Work Function Algorithm for Solving the On-Line k-Server Problem
ISBN: 9789537138127, 9537138127ISSN: 1330-1012Vydáno: Zagreb IEEE 01.06.2008Vydáno v ITI 2008 : proceedings of the ITI 2008 30th International Conference on Information Technology Interfaces (01.06.2008)“…We study a modification of the well known work function algorithm (WFA) for solving the on-line k-server problem…”
Získat plný text
Konferenční příspěvek -
19
Asymptotically Optimal Online Page Migration on Three Points
ISSN: 0178-4617, 1432-0541Vydáno: Boston Springer US 01.04.2015Vydáno v Algorithmica (01.04.2015)“…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ískat plný text
Journal Article -
20
A new approach to solve the k-server problem based on network flows and flow cost reduction
ISSN: 0305-0548, 1873-765X, 0305-0548Vydáno: Kidlington Elsevier Ltd 01.04.2013Vydáno v Computers & operations research (01.04.2013)“…) and the on-line work function algorithm (WFA). Both algorithms are usually implemented by network flow techniques including the flow augmentation method…”
Získat plný text
Journal Article

