Výsledky vyhľadávania - Work function algorithm

Upresniť hľadanie
  1. 1

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

    ISSN: 1435-246X, 1613-9178
    Vydavateľské údaje: Heidelberg Springer 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ískať plný text
    Journal Article
  2. 2

    On the competitive ratio of the work function algorithm for the k-server problem Autor Bartal, Yair, Koutsoupias, Elias

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Amsterdam Elsevier B.V 20.09.2004
    Vydané 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ískať plný text
    Journal Article
  3. 3

    The work function algorithm for the paging problem Autor Zhang, Wenming, Hu, Huan, Cheng, Yongxi, Li, Hongmei, Wang, Haizhen

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 21.09.2022
    Vydané 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ískať plný text
    Journal Article
  4. 4

    Proof of Work with Random Selection (PoWR): An Energy Saving Consensus Algorithm with Proof of Work and the Random Selection Function Autor Jung, Jin Woo, Islam, Md. Mainul, In, Hoh Peter

    ISSN: 2071-1050, 2071-1050
    Vydavateľské údaje: Basel MDPI AG 01.11.2024
    Vydané v Sustainability (01.11.2024)
    “…Bitcoin, which has been used for 13 years, has a role in transactions and investments as a major cryptocurrency. However, as the number of users increases,…”
    Získať plný text
    Journal Article
  5. 5

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

    ISSN: 0097-5397, 1095-7111
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.01.2014
    Vydané v SIAM journal on computing (01.01.2014)
    “… We consider the general model where the cost function of the two servers may be different. Formally, each server moves in its own metric space and a request consists of one point in each metric space…”
    Získať plný text
    Journal Article
  6. 6

    A new upper bound on the work function algorithm for the k-server problem Autor Zhang, Wenming, Cheng, Yongxi

    ISSN: 1382-6905, 1573-2886
    Vydavateľské údaje: New York Springer US 01.02.2020
    Vydané 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ískať plný text
    Journal Article
  7. 7

    Multi-guiding spark fireworks algorithm: Solving multimodal functions by multiple guiding sparks in fireworks algorithm Autor Meng, Xiangrui, Tan, Ying

    ISSN: 2210-6502
    Vydavateľské údaje: Elsevier B.V 01.03.2024
    Vydané v Swarm and evolutionary computation (01.03.2024)
    “… The fireworks algorithm (FWA) is a swarm intelligence optimization algorithm that has been widely studied and applied by virtue of the synergistic property among firework…”
    Získať plný text
    Journal Article
  8. 8

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

    ISSN: 2255-8950, 2255-8942, 2255-8950
    Vydavateľské údaje: Riga University of Latvia 2020
    “…In this paper the compound work function algorithm for solving the generalized k-server problem is proposed…”
    Získať plný text
    Journal Article
  9. 9

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

    ISSN: 1435-246X, 1613-9178
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2015
    “…In this paper we propose an approximate implementation of the work function algorithm (WFA…”
    Získať plný text
    Journal Article
  10. 10

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

    ISSN: 1435-246X, 1613-9178
    Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.01.2013
    “…This paper deals with the work function algorithm (WFA) for solving the on-line k -server problem…”
    Získať plný text
    Journal Article
  11. 11
  12. 12

    Loser-Out Tournament-Based Fireworks Algorithm for Multimodal Function Optimization Autor Li, Junzhi, Tan, Ying

    ISSN: 1089-778X, 1941-0026
    Vydavateľské údaje: New York IEEE 01.10.2018
    “… In this paper, a loser-out tournament-based fireworks algorithm (LoTFWA) is proposed for solving multimodal optimization problems…”
    Získať plný text
    Journal Article
  13. 13

    On the additive constant of the k-server Work Function Algorithm Autor Emek, Yuval, Fraigniaud, Pierre, Korman, Amos, Rosén, Adi

    ISSN: 0020-0190, 1872-6119
    Vydavateľské údaje: Amsterdam Elsevier B.V 30.11.2010
    Vydané v Information processing letters (30.11.2010)
    “…We consider the Work Function Algorithm for the k-server problem (Chrobak and Larmore, 1991…”
    Získať plný text
    Journal Article
  14. 14

    Deep Learning Algorithms for the Work Function Fluctuation of Random Nanosized Metal Grains on Gate-All-Around Silicon Nanowire MOSFETs Autor Akbar, Chandni, Li, Yiming, Sung, Wen-Li

    ISSN: 2169-3536, 2169-3536
    Vydavateľské údaje: Piscataway IEEE 2021
    Vydané v IEEE access (2021)
    “… for gate-all-around silicon nanowire metal-oxide-semiconductor field-effect transistors (MOSFETs) to predict electrical characteristics of device induced by work function fluctuation…”
    Získať plný text
    Journal Article
  15. 15

    Teamwork Optimization Algorithm: A New Optimization Approach for Function Minimization/Maximization Autor Dehghani, Mohammad, Trojovský, Pavel

    ISSN: 1424-8220, 1424-8220
    Vydavateľské údaje: MDPI 03.07.2021
    Vydané v Sensors (Basel, Switzerland) (03.07.2021)
    “… In this paper, a new population-based optimization algorithm called the Teamwork Optimization Algorithm (TOA…”
    Získať plný text
    Journal Article
  16. 16

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

    ISSN: 0968-090X, 1879-2359
    Vydavateľské údaje: United Kingdom Elsevier Ltd 01.12.2019
    “…•The lookahead online algorithm is compared with other dispatching policies.•Server availability is considered by estimating service times of each request…”
    Získať plný text
    Journal Article
  17. 17

    Improved fireworks algorithm with information exchange for function optimization Autor Cheng, Rong, Bai, Yanping, Zhao, Yu, Tan, Xiuhui, Xu, Ting

    ISSN: 0950-7051, 1872-7409
    Vydavateľské údaje: Amsterdam Elsevier B.V 01.01.2019
    Vydané v Knowledge-based systems (01.01.2019)
    “…The fireworks algorithm, which is inspired by the explosion of fireworks, is a new swarm-based meta-heuristic algorithm for global optimization…”
    Získať plný text
    Journal Article
  18. 18

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

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Elsevier B.V 01.07.2019
    “…•We designed a new holistic algorithm that solves K-server problem more efficiently…”
    Získať plný text
    Journal Article
  19. 19

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

    ISSN: 1330-1136, 1846-3908
    Vydavateľské údaje: Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu 2010
    “…This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem…”
    Získať plný text
    Journal Article Paper
  20. 20