Výsledky vyhledávání - "Work function algorithm"

Combinatorial Algorithms for Server Allocation Problem

Autoři: Sowle, Rachita

Thesis Advisors: Computer Science and#38; Applications, Raghvendra, Sharath, Tripathy, Chittaranjan, Murali, T. M., Zhang, Liqing, Heath, Lenwood S.

Témata: Euclidean bipartite matching, k-server problem, work function algorithm, taxi allocation problem

Popis souboru: ETD; application/pdf

Dostupnost: https://hdl.handle.net/10919/121081

A Scalable Work Function Algorithm for the k-Server Problem

Autoři: Raghvendra, Sharath Sowle, Rachita Sharath Raghvendra and Rachita Sowle

Přispěvatelé: Raghvendra, Sharath Sowle, Rachita Sharath Raghvendra and Rachita Sowle

Témata: k-server, Work Function Algorithm, Minimum-cost Flow

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 227, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.30

Dostupnost: https://doi.org/10.4230/LIPIcs.SWAT.2022.30
https://nbn-resolving.org/urn:nbn:de:0030-drops-161906
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.30

Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle

Autoři: Coester, Christian Koutsoupias, Elias Christian Coester and Elias Koutsoupias

Přispěvatelé: Coester, Christian Koutsoupias, Elias Christian Coester and Elias Koutsoupias

Témata: FOS: Computer and information sciences, work function algorithm, Computer Science - Data Structures and Algorithms, Online algorithms, k-server, 0211 other engineering and technologies, competitive analysis, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2102.10474
https://ora.ox.ac.uk/objects/uuid:fb0783e5-6a0d-48e8-95ab-04dd53086aa6
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-10474
https://ir.cwi.nl/pub/31123
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.57

Work Function Algorithm with a Moving Window for Solving the On-Line k-Server Problem

Autoři: Alfonzo Baumgartner Zeljko Hocenski Robert Manger a další

Přispěvatelé: Alfonzo Baumgartner Zeljko Hocenski Robert Manger a další

Zdroj: 2007 29th International Conference on Information Technology Interfaces. :591-596

Témata: the work function algorithm (WFA), the k-server problem, moving windows, on-line problems, on-line algorithms, experiments, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, k-server problem, work function algorithm (WFA)

Přístupová URL adresa: http://hrcak.srce.hr/file/69240
http://cit.fer.hr/index.php/CIT/article/download/1650/1354
https://www.bib.irb.hr/298509
https://www.bib.irb.hr/321479
http://cit.fer.hr/index.php/CIT/article/view/1650
https://dblp.uni-trier.de/db/journals/cit/cit15.html#BaumgartnerMH07
http://cit.fer.hr/index.php/CIT/article/download/1650/1354
https://www.bib.irb.hr/298509
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004283838
http://ieeexplore.ieee.org/document/4283838/
https://ieeexplore.ieee.org/document/4283838/

Topology matters: Smoothed competitiveness of metrical task systems: Topology matters: smoothed competitiveness of metrical task systems

Autoři: Schäfer, Guido Sivadasan, Naveen Guido Schäfer and Naveen Sivadasan

Přispěvatelé: Schäfer, Guido Sivadasan, Naveen Guido Schäfer and Naveen Sivadasan

Zdroj: Lecture Notes in Computer Science ISBN: 9783540212362

Témata: Competitive analysis, work function algorithm, Online algorithms, 0211 other engineering and technologies, Metrical task systems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, metrical task systems, Theoretical Computer Science, online algorithm, Work function algorithm, Smoothed analysis, Analysis of algorithms, smoothed competitive analysis, ddc:004, Computer Science(all)

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2005/68/pdf/05031.SchaeferGuido.ExtAbstract.68.pdf
https://zbmath.org/2207176
https://doi.org/10.1016/j.tcs.2005.04.006
https://core.ac.uk/display/24667025
https://rd.springer.com/chapter/10.1007/978-3-540-24749-4_43
https://dblp.uni-trier.de/db/conf/stacs/stacs2004.html#SchaferS04
https://link.springer.com/chapter/10.1007%2F978-3-540-24749-4_43
http://homepages.cwi.nl/~schaefer/ftp/pdf/mts-jv.pdf
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1819246
https://core.ac.uk/display/82332263
https://dblp.uni-trier.de/db/journals/tcs/tcs341.html#SchaferS05
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1819246
https://www.sciencedirect.com/science/article/pii/S030439750500318X
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.29

On the competitiveness of a modified work function algorithm for solving the on-line k-server problem

Autoři: Robert Manger Tomislav Rudec Lužar-Stiffler, Vesna a další

Přispěvatelé: Robert Manger Tomislav Rudec Lužar-Stiffler, Vesna a další

Zdroj: ITI 2008 - 30th International Conference on Information Technology Interfaces. :779-784

Témata: competitiveness, k-server problem, work function algorithm (WFA), moving windows, on-line problems, on-line algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://www.bib.irb.hr/381173
https://ieeexplore.ieee.org/document/4588510/
https://www.bib.irb.hr/381173
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004588510
https://dblp.uni-trier.de/db/conf/iti/iti2008.html#RudecM08

A fast approximate implementation of the work function algorithm for solving the $$k$$ k -server problem

Autoři: Robert Manger Tomislav Rudec

Zdroj: Central European Journal of Operations Research. 23:699-722

Témata: k-server problem, work function algorithm, network flows, 0211 other engineering and technologies, combinatorial optimization, 0102 computer and information sciences, 02 engineering and technology, cost reduction, on-line computation, implementation, 01 natural sciences

Přístupová URL adresa: https://www.bib.irb.hr/796236
https://doi.org/10.1007/s10100-014-0349-4
https://link.springer.com/article/10.1007/s10100-014-0349-4
https://doi.org/10.1007/s10100-014-0349-4

A new approach to solve the k-server problem based on network flows and flow cost reduction

Autoři: Robert Manger Tomislav Rudec

Zdroj: Computers & Operations Research. 40:1004-1013

Témata: on-line problems, k-server problem, optimal off-line algorithm, work function algorithm, implementation, network flows, cost reduction, experiments, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

A fast work function algorithm for solving the k-server problem

Autoři: Alfonzo Baumgartner Robert Manger Tomislav Rudec

Zdroj: Central European Journal of Operations Research. 21:187-205

Témata: k-server problem, work function algorithm, implementation. network flows, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, on-line problems, on-line algorithms, 01 natural sciences

Přístupová URL adresa: https://www.bib.irb.hr/540487
https://doi.org/10.1007/s10100-011-0222-7

The design and analysis of a modified work function algorithm for solving the on-line k-server problem

Autoři: Manger, Robert Rudec, Tomislav

Zdroj: Computing and informatics. 29(4):681-700

Témata: competitiveness, computational complexity, k-server problem, work function algorithm (WFA), network flows, moving windows, experiments, implementation, on-line algorithms, performance, on-line problems

Přístupová URL adresa: http://www.sav.sk/index.php?lang=sk&charset=&doc=journal&part=list_articles&journal_issue_no=11112385#abstract_5962

The k-server problem with parallel requests and the compound work function algorithm

Autoři: Hildenbrandt, Regina

Témata: article, ScholarlyArticle, ddc:510, online optimization -- analysis of algorithms -- competitive analysis -- server problems -- the compound work function algorithm

Popis souboru: 20 Seiten

Relation: http://uri.gbv.de/document/gvk:ppn:88091047X

Dostupnost: https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2017200221
https://www.db-thueringen.de/receive/dbt_mods_00031742
https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00037907/IfM_Preprint_M_17_04.pdf
http://uri.gbv.de/document/gvk:ppn:88091047X

Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem

Autoři: Baumgartner, Alfonzo Hocenski, Željko

Zdroj: CIT. Journal of computing and information technology. 15(4):325-330

Témata: k-server problem, work function algorithm (WFA), moving windows, experiments, on-line algorithms, on-line problems

On the k -server conjecture: On the \(k\)-server conjecture

Autoři: Koutsoupias, E Papadimitriou, C

Zdroj: Journal of the ACM. 42:971-983

Témata: quasi-convexity property, work function algorithm, potential function, Parallel algorithms in computer science

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1103551
https://doi.org/10.1145/210118.210128
https://dblp.uni-trier.de/db/journals/jacm/jacm42.html#KoutsoupiasP95
https://dl.acm.org/doi/10.1145/210118.210128
https://core.ac.uk/display/24022742
https://dl.acm.org/citation.cfm?id=210128
https://doi.org/10.1145/210118.210128
https://www.cs.ox.ac.uk/publications/publication7879-abstract.html
https://dl.acm.org/doi/10.1145/195058.195245
https://www.cs.ox.ac.uk/publications/publication7880-abstract.html
http://portal.acm.org/citation.cfm?doid=195058.195245
https://ora.ox.ac.uk/objects/uuid:1cc2985c-0f40-494c-9143-22dfa2d635e3
https://ora.ox.ac.uk/objects/uuid:e4b6b6b7-94e6-430f-8450-a1f858f5a406

Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle

Autoři: Coester, C.E. (Christian) Koutsoupias, E. (Elias)

Témata: Competitive analysis, K-server, Online algorithms, Work function algorithm

Popis souboru: application/pdf

Relation: info:eu-repo/grantAgreement/NWO/NWO/639.023.812; https://ir.cwi.nl/pub/31123

Dostupnost: https://ir.cwi.nl/pub/31123
https://doi.org/10.4230/LIPIcs.ICALP.2021.57

Traversing Layered Graphs Using the Work Function Algorithm: Traversing layered graphs using the work function algorithm

Autoři: William R. Burley

Zdroj: Journal of Algorithms. 20:479-511

Témata: work function algorithm, Graph theory (including graph drawing) in computer science, 0102 computer and information sciences, Parallel algorithms in computer science, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/885498
https://doi.org/10.1006/jagm.1996.0024
https://dl.acm.org/doi/10.1006/jagm.1996.0024
https://www.sciencedirect.com/science/article/pii/S0196677496900243
https://dblp.uni-trier.de/db/journals/jal/jal20.html#Burley96

Topology Matters: Smoothed Competitiveness of Metrical Task Systems

Autoři: Schäfer, Guido Sivadasan, Naveen Guido Schäfer and Naveen Sivadasan

Přispěvatelé: Schäfer, Guido Sivadasan, Naveen Guido Schäfer and Naveen Sivadasan

Témata: online algorithm, metrical task systems, work function algorithm, smoothed competitive analysis

Popis souboru: application/pdf

Relation: Is Part Of Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005); https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.29

Dostupnost: https://doi.org/10.4230/DagSemProc.05031.29
https://nbn-resolving.org/urn:nbn:de:0030-drops-684
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.29

Measuring True Performance of the Work Function Algorithm for Solving the On-line k-Server Problem

Autoři: Rudec, Tomislav Baumgartner, Alfonzo Manger, Robert

Zdroj: Journal of computing and information technology ; ISSN 1846-3908 (Online) ; ISSN 1330-1136 (Print) ; ISSN-L 1330-1136 ; CODEN CJCTEM ; Volume 18 ; Issue 4

Témata: on-line problems, on-line algorithms, k-server problem, work function algorithm (WFA), experiments

Popis souboru: application/pdf

Relation: https://hrcak.srce.hr/172991

Dostupnost: https://hrcak.srce.hr/172991
https://hrcak.srce.hr/file/255285

Nested Convex Bodies are Chaseable

Autoři: Bansal, Nikhil Bohm, Martin Elias, Marek a další

Zdroj: WoS

Témata: Computer Science, Software Engineering, Mathematics, Applied, convex body chasing, nested convex body chasing, online algorithms, competitive analysis, work function algorithm

Relation: Algorithmica; https://infoscience.epfl.ch/handle/20.500.14299/164345; WOS:000503660100001

Dostupnost: https://doi.org/10.1007/s00453-019-00661-x
https://infoscience.epfl.ch/handle/20.500.14299/164345
https://hdl.handle.net/20.500.14299/164345

A network flow implementation of a modified work function algorithm for solving the k-server problem

Autoři: Baumgartner, Alfonzo Hocenski, Željko Manger, Robert a další

Přispěvatelé: Baumgartner, Alfonzo Hocenski, Željko Manger, Robert a další

Témata: computational complexity, k-server problem, work function algorithm (WFA), network flows, moving windows, implementation, on-line algorithms, on-line problems

Přístupová URL adresa: https://www.bib.irb.hr/321497

The design and analysis of a modified work function algorithm for solving the on-line k-server problem

Autoři: Alfonzo Baumgartner Tomislav Rudec Robert Manger

Zdroj: COMPUTING AND INFORMATICS; Vol 29, No 4 (2010): Computing and Informatics; 681-700

Témata: On-line problems, on-line algorithms, k-server problem, fork function algorithm (WFA), moving windows, competitiveness, implementation, network flows, experiments, performance, computational complexity, on-line problems, work function algorithm (WFA)

Popis souboru: application/pdf

Přístupová URL adresa: https://www.bib.irb.hr/457047
http://www.cai.sk/ojs/index.php/cai/article/view/108