Zobrazeno 1 - 10 of 230 pro vyhledávání: '"Randomized algorithms as zero-sum games"'
1
Precise Estimates for the Time Complexity of Implementing Algorithms of Set-Theoretic Operations in Table Algebras
Autor: I. S. Kanarskaya, A. S. Senchenko, D. B. Buy, V. N. Red'ko
Publikováno v: Cybernetics and Systems Analysis. 53:1-11
Algorithms implementing intersection, union, and difference in table algebras are investigated. Modifications of the most widespread algorithms reducing the amount of computations are proposed. Based on the complexities evaluated in the worst case an
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e08867cd4e3d5c69c19feb15699d673c
https://doi.org/10.1007/s10559-017-9901-2
Zobrazit plný text záznamu
2
A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs
Autor: Aydin Buluc, Ariful Azad
Publikováno v: Azad, A; & Buluç, A. (2016). A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs. Parallel Computing, 58, 117-130. doi: 10.1016/j.parco.2016.05.007. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/5d808876
© 2016 We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributed-memory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simul
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b5492e2f542c11716faef9c62146e6e
https://doi.org/10.1016/j.parco.2016.05.007
Zobrazit plný text záznamu
5
R–LINE: A better randomized 2-server algorithm on the line
Autor: Wolfgang W. Bein, Lucas Bang, Lawrence L. Larmore
Publikováno v: Theoretical Computer Science. 605:106-118
A randomized on-line algorithm is given for the 2-server problem on the line, with competitiveness less than 1.901 against the oblivious adversary. This improves the previously best known competitiveness of 155 78 ? 1.987 for the problem. The algorit
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::121a98a0d6330ab423d45b368a014637
https://doi.org/10.1016/j.tcs.2015.08.043
Zobrazit plný text záznamu
6
TOP
Autor: Yufei Ding, Xipeng Shen, Todd Mytkowicz, Madanlal Musuvathi
Publikováno v: Proceedings of the VLDB Endowment. 8:1046-1057
Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often throu
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ef551563ed4aa0c8a2cb8961071a0159
https://doi.org/10.14778/2794367.2794374
Zobrazit plný text záznamu
7
Origin-Based Algorithms for Traffic Assignment
Autor: Jun Xie, Chi Xie
Publikováno v: Transportation Research Record: Journal of the Transportation Research Board. 2498:46-55
This paper presents an extensive analytical and numerical investigation of a class of origin-based algorithms for the user equilibrium–based traffic assignment problem. Nine known algorithms in this class are first clustered into four algorithmic s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7efbefc3a44250a36990dcb0019f9562
https://doi.org/10.3141/2498-06
Zobrazit plný text záznamu
8
Speeding up search-based algorithms for level generation in physics-based puzzle games
Autor: Claudio Fabiano Motta Toledo, Leonardo T. Pereira
Publikováno v: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
This research uses Machine Learning (ML) techniques in order to aid search-based (SB) algorithms to improve level generation for physics-based puzzle games. These algorithms’ performance are improved by reducing simulation time when the ML techniqu
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3340ff0ce510abbff240a849b4a37d15
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje