Suchergebnisse - "Randomised algorithms"

Naively Sorting Evolving Data is Optimal and Robust

Autoren: Giakkoupis, George Kiwi, Marcos Los, Dimitrios et al.

Weitere Verfasser: Giakkoupis, George Kiwi, Marcos Los, Dimitrios et al.

Quelle: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). :2217-2242

Schlagwörter: Sorting algorithms, FOS: Computer and information sciences, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], G.3, Comparison sorting, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 68W20, 68W40, 68P10, Randomised algorithms, Potential functions, Stochastic processes, F.2.2, Computer Science - Data Structures and Algorithms, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Evolving data, Distributed algorithms, Noisy information, Data Structures and Algorithms (cs.DS), Incomplete information

Zugangs-URL: http://arxiv.org/abs/2404.08162

Load Thresholds for Cuckoo Hashing with Overlapping Blocks

Autoren: Stefan Walzer

Weitere Verfasser: Stefan Walzer

Quelle: ACM Transactions on Algorithms. 19:1-22

Schlagwörter: FOS: Computer and information sciences, Hypergraph Orientability, Cuckoo Hashing, Unaligned Blocks, 0102 computer and information sciences, 01 natural sciences, Load Thresholds, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, Randomised Algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1707.06855
https://dblp.uni-trier.de/db/conf/icalp/icalp2018.html#Walzer18
https://portal.dnb.de/opac.htm?method=simpleSearch&cqlMode=true&query=idn%3D1208149946
https://drops.dagstuhl.de/opus/volltexte/2018/9106/pdf/LIPIcs-ICALP-2018-102.pdf/
https://drops.dagstuhl.de/opus/volltexte/2018/9106/
https://www.db-thueringen.de/receive/dbt_mods_00041045
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.102

Multicoloured Hardcore Model: Fast Mixing and Its Applications as a Scheduling Algorithm

Autoren: Olesker-Taylor, Sam Sam Olesker-Taylor

Weitere Verfasser: Olesker-Taylor, Sam Sam Olesker-Taylor

Schlagwörter: proper colourings, data transmission, queueing theory, mixing time, independent set, randomised algorithms, routing, scheduling, ddc:004, hardcore model, multihop wireless networks

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2024.20

A Randomised Lattice Rule Algorithm with Pre-determined Generating Vector and Random Number of Points for Korobov Spaces with $$0 < \alpha \le 1/2$$

Autoren: Nuyens, Dirk Wilkes, Laurence Hinrichs, A. et al.

Weitere Verfasser: Nuyens, Dirk Wilkes, Laurence Hinrichs, A. et al.

Quelle: Springer Proceedings in Mathematics & Statistics ISBN: 9783031597619

Schlagwörter: CONSTRUCTION, 4. Education, Tractability, BOUNDS, G.1.2, Numerical Analysis (math.NA), Lattice rules, G.1.4, Randomised algorithms, TRACTABILITY, Korobov space, Numerical integration, FOS: Mathematics, 65D30, 65D32, Mathematics - Numerical Analysis, ACHIEVE, INTEGRATION, Quasi-monte carlo, ERROR

Zugangs-URL: http://arxiv.org/abs/2308.03138
https://lirias.kuleuven.be/handle/20.500.12942/751076
https://doi.org/10.1007/978-3-031-59762-6_25

Control analysis and design via randomised coordinate polynomial minimisation

Autoren: Calafiore G. C. Novara C. Possieri C. et al.

Weitere Verfasser: Calafiore G. C. Novara C. Possieri C. et al.

Quelle: International journal of control
(2020). doi:10.1080/00207179.2020.1782476
info:cnr-pdr/source/autori:Calafiore, Giuseppe C.; Novara, Carlo; Possieri, Corrado/titolo:Control analysis and design via randomised coordinate polynomial minimisation/doi:10.1080%2F00207179.2020.1782476/rivista:International journal of control (Print)/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume

Schlagwörter: 0209 industrial biotechnology, Nonlinear control, optimal control, optimisation methods, randomised algorithms, robustness, Optimisation methods, 02 engineering and technology, Settore ING-INF/04 - AUTOMATICA, Optimal control, Randomised algorithms, Robustness, Settore IINF-04/A - Automatica

Dateibeschreibung: application/pdf

Zugangs-URL: https://iris.polito.it/handle/11583/2854580
https://www.tandfonline.com/doi/abs/10.1080/00207179.2020.1782476
https://hdl.handle.net/20.500.14243/384219
http://www.scopus.com/record/display.url?eid=2-s2.0-85087453783&origin=inward
https://doi.org/10.1080/00207179.2020.1782476

Randomised block‐coordinate Frank‐Wolfe algorithm for distributed online learning over networks

Autoren: Quanbo Ge Zhu Junlong Zhang Mingchuan et al.

Quelle: Cognitive Computation and Systems (2020)

Schlagwörter: distributed online algorithms, convex functions, Computer engineering. Computer hardware, 0209 industrial biotechnology, computational complexity, constrained optimisation problems, Computer applications to medicine. Medical informatics, R858-859.7, 02 engineering and technology, convex programming, TK7885-7895, distributed online learning, randomised algorithms, subgradient vector, randomised block-coordinate frank-wolfe algorithm, 0202 electrical engineering, electronic engineering, information engineering, learning (artificial intelligence), frank-wolfe method, gradient methods, full gradient vector

Zugangs-URL: https://ietresearch.onlinelibrary.wiley.com/doi/pdfdirect/10.1049/ccs.2020.0007
https://doaj.org/article/4b3ef69771cf4880b097274a2fc6d97d
https://digital-library.theiet.org/content/journals/10.1049/ccs.2020.0007
https://ietresearch.onlinelibrary.wiley.com/doi/pdf/10.1049/ccs.2020.0007
https://ieeexplore.ieee.org/document/9115375
https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/ccs.2020.0007

Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration

Autoren: Kuo, Frances Y. Nuyens, Dirk Wilkes, Laurence

Quelle: ISSN:0885-064X ; ISSN:1090-2708 ; Journal Of Complexity, vol. 79, Art.No. 101785.

Schlagwörter: Randomised algorithms, Numerical integration, Lattice rules, Tractability, Quasi-Monte Carlo, Korobov Space, Science & Technology, Technology, Physical Sciences, Computer Science, Theory & Methods, Mathematics, Applied, BY-COMPONENT CONSTRUCTION, WEIGHTED KOROBOV, MULTIVARIATE INTEGRATION, RULES, EQUATIONS, ACHIEVE, SPACES, ERROR, 0102 Applied Mathematics, 0103 Numerical and Computational Mathematics, 0802 Computation Theory and Mathematics, Numerical & Computational Mathematics, 4613 Theory of computation, 4901 Applied mathematics

Dateibeschreibung: application/pdf

Relation: https://lirias.kuleuven.be/handle/20.500.12942/734371; https://doi.org/10.1016/j.jco.2023.101785

Verfügbarkeit: https://lirias.kuleuven.be/handle/20.500.12942/734371
https://hdl.handle.net/20.500.12942/734371
https://lirias.kuleuven.be/retrieve/646debc4-5ff7-4a09-8dfc-b0e690765b84
https://doi.org/10.1016/j.jco.2023.101785

Some New (And Old) Results on Contention Resolution (Invited Talk)

Autoren: Goldberg, Leslie Ann Leslie Ann Goldberg

Weitere Verfasser: Goldberg, Leslie Ann Leslie Ann Goldberg

Schlagwörter: contention resolution, multiple access channel, randomised algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.3

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.ICALP.2022.3
https://nbn-resolving.org/urn:nbn:de:0030-drops-163444
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.3

Cellular distributed and parallel computing

Autoren: Xu, Lei Jeavons, Peter

Weitere Verfasser: Xu, Lei Jeavons, Peter

Schlagwörter: 004, Computer science (mathematics), Distributed and Parallel Computing, Bio-inspired Computing, Randomised Algorithms, Distributed Networks, Time and Message Complexity

Zugangs-URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.669823

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields

Autoren: Nitin Saxena Gábor Ivanyos Igor E. Shparlinski et al.

Weitere Verfasser: Nitin Saxena Gábor Ivanyos Igor E. Shparlinski et al.

Quelle: Algorithmica. 80:560-575

Schlagwörter: FOS: Computer and information sciences, rational functions, [INFO] Computer Science [cs], Polynomials, Randomised algorithm, Nullstellensatz, Number theory, Black boxes, Computer Science - Data Structures and Algorithms, Black-box interpolation, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Number Theory (math.NT), quantum algorithms, Rational Function, QA Mathematics / matematika, Mathematics - Number Theory, Hidden polynomial power, Deterministic algorithm, Deterministic algorithms, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, interpolation, Randomised algorithms, Quantum algorithm, Quantum Theory, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

Dateibeschreibung: text

Zugangs-URL: http://eprints.sztaki.hu/9543/1/Ivanyos_560_3263802_ny.pdf
http://arxiv.org/abs/1502.06631
https://dblp.uni-trier.de/db/journals/corr/corr1502.html#IvanyosKSSS15
http://theory.cs.uni-bonn.de/ftp/reports/cs-reports/2015/85353-CS.pdf
http://dblp.uni-trier.de/db/journals/corr/corr1502.html#IvanyosKSSS15
https://researchers.mq.edu.au/en/publications/polynomial-interpolation-and-identity-testing-from-high-powers-ov
https://link.springer.com/article/10.1007/s00453-016-0273-1
https://arxiv.org/abs/1502.06631
https://eprints.sztaki.hu/9543/

Communication and Streaming Complexity of Approximate Pattern Matching

Autoren: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) et al.

Weitere Verfasser: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) et al.

Quelle: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
https://hal.science/hal-03942927
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.13⟩

Schlagwörter: 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity phrases approximate pattern matching edit distance randomised algorithms streaming algorithms communication complexity, 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity phrases approximate pattern matching, edit distance, randomised algorithms, streaming algorithms, communication complexity, [INFO]Computer Science [cs]

Geographisches Schlagwort: Warsaw, Poland

Relation: hal-03942927; https://hal.science/hal-03942927; https://hal.science/hal-03942927/document; https://hal.science/hal-03942927/file/LIPIcs-CPM-2017-13.pdf

Verfügbarkeit: https://hal.science/hal-03942927
https://hal.science/hal-03942927/document
https://hal.science/hal-03942927/file/LIPIcs-CPM-2017-13.pdf
https://doi.org/10.4230/LIPIcs.CPM.2017.13

A randomised approach for NARX model identification based on a multivariate Bernoulli distribution

Autoren: BIANCHI, FEDERICO FALSONE, ALESSANDRO PRANDINI, MARIA et al.

Quelle: International Journal of Systems Science

Schlagwörter: 0209 industrial biotechnology, model structure selection, multivariate Bernoulli distribution, Nonlinear model identification, polynomial NARX models, prediction error minimisation methods, randomised algorithms, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications1707 Computer Vision and Pattern Recognition, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Dateibeschreibung: application/pdf

Zugangs-URL: https://re.public.polimi.it/bitstream/11311/1009157/1/review_v3_journal_guidelines.pdf
https://re.public.polimi.it/handle/11311/1009157
https://dblp.uni-trier.de/db/journals/ijsysc/ijsysc48.html#BianchiFPP17
http://ui.adsabs.harvard.edu/abs/2017IJSS...48.1203B/abstract
https://doi.org/10.1080/00207721.2016.1244309
https://www.politesi.polimi.it/bitstream/10589/116329/1/2015_12_Bianchi.pdf
https://re.public.polimi.it/bitstream/11311/1009157/1/review_v3_journal_guidelines.pdf

Load Thresholds for Cuckoo Hashing with Overlapping Blocks

Autoren: Walzer, Stefan Stefan Walzer

Weitere Verfasser: Walzer, Stefan Stefan Walzer

Schlagwörter: Cuckoo Hashing, Unaligned Blocks, Hypergraph Orientability, Load Thresholds, Randomised Algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.102

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.ICALP.2018.102
https://nbn-resolving.org/urn:nbn:de:0030-drops-91068
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.102

Divoká binární segmentace

Autoren: Lasota, Jakub Pešta, Michal Maciak, Matúš

Weitere Verfasser: Lasota, Jakub Pešta, Michal Maciak, Matúš

Schlagwörter: multiple change-points|change-point detection|binary segmentation|randomised algorithms|information criterion, více bodů změny|detekce bodů změny|binární segmentace|randomizované algoritmy|informační kritérium

Zugangs-URL: http://www.nusl.cz/ntk/nusl-621384

Combining biased random sampling with metaheuristics for the facility location problem in distributed computer systems

Autoren: Cabrera Añon, Guillem González Martín, Sergio Juan Pérez, Ángel Alejandro et al.

Quelle: O2, repositorio institucional de la UOC
Universitat Oberta de Catalunya (UOC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Schlagwörter: mètodes de mostreig, Algoritmos, facility location, 0211 other engineering and technologies, localización de instalaciones, statistical distributions, Algorismes, localització d'instal·lacions, 02 engineering and technology, distribución de probabilidad, algoritmos aleatorios, processos estocàstics, sampling methods, métodos de muestreo, algoritmes aleatoris, randomised algorithms, procesos estocásticos, stochastic processes, distribució de probabilitat, internet, Algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/10609/90873
https://ieeexplore.ieee.org/document/7020139/
http://openaccess.uoc.edu/webapps/o2/handle/10609/90873
http://informs-sim.org/wsc14papers/includes/files/269.pdf
https://dblp.uni-trier.de/db/conf/wsc/wsc2014.html#CabreraGJMG14
https://dl.acm.org/doi/10.5555/2693848.2694227
http://ieeexplore.ieee.org/document/7020139/

Dealing with the curse of dimensionality in systems and control: The randomization paradigm

Autoren: Dabbene F

Quelle: 2014 IEEE 53rd Annual Conference on Decision and Control (CDC), pp. 2248–2256, 2015-February
info:cnr-pdr/source/autori:Dabbene F./congresso_nome:2014 IEEE 53rd Annual Conference on Decision and Control (CDC)/congresso_luogo:/congresso_data:2015-February/anno:2014/pagina_da:2248/pagina_a:2256/intervallo_pagine:2248–2256

Schlagwörter: 0209 industrial biotechnology, computational complexity iterative methods least squares approximations matrix algebra optimisation randomised algorithms robust control, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://ieeexplore.ieee.org/document/7039732/
https://dblp.uni-trier.de/db/conf/cdc/cdc2014.html#Dabbene14
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7039732&url=http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7039732
https://doi.org/10.1109/CDC.2014.7039732
https://hdl.handle.net/20.500.14243/334370

Wild binary segmentation ; Divoká binární segmentace

Autoren: Lasota, Jakub Pešta, Michal Maciak, Matúš

Weitere Verfasser: Lasota, Jakub Pešta, Michal Maciak, Matúš

Schlagwörter: multiple change-points|change-point detection|binary segmentation|randomised algorithms|information criterion, více bodů změny|detekce bodů změny|binární segmentace|randomizované algoritmy|informační kritérium

Dateibeschreibung: application/pdf; application/octet-stream

Relation: http://hdl.handle.net/20.500.11956/191965; 264054

Verfügbarkeit: https://hdl.handle.net/20.500.11956/191965

Zero problems in polynomial models ; Problèmes de zéro dans les modèles polynomiaux

Autoren: Nosan, Klara Université Paris Cité Shirmohammadi, Mahsa et al.

Weitere Verfasser: Nosan, Klara Université Paris Cité Shirmohammadi, Mahsa et al.

Schlagwörter: Circuits algébriques, Complexité de calcul, Procédures de décision, Suites hypergéométriques, Test d'identité dans les corps de nombres, Algorithmes randomisés, Atteignabilité, Algebraic Circuits, Computational Complexity, Decision Procedures Hypergeometric Sequences, Identity Testing in Number Fields, Randomised Algorithms, Reachability

Relation: http://www.theses.fr/2024UNIP7008/document

Verfügbarkeit: http://www.theses.fr/2024UNIP7008/document

Pattern matching with don't cares and few errors

Autoren: Clifford, Raphael Efremo, Klim Porat, Ely et al.

Weitere Verfasser: Clifford, Raphael Efremo, Klim Porat, Ely et al.

Quelle: Journal of Computer and System Sciences. 76:115-124

Schlagwörter: String algorithms, Computer Networks and Communications, Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, Streaming, 01 natural sciences, Theoretical Computer Science, Randomised algorithms, Pattern Matching, Computational Theory and Mathematics, Group Testing, 0202 electrical engineering, electronic engineering, information engineering, ddc:004, Pattern matching, Group testing, Prime Numbers

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.5

Longest Common Substring with Approximately k Mismatches

Autoren: Starikovskaya, Tatiana Tatiana Starikovskaya

Weitere Verfasser: Starikovskaya, Tatiana Tatiana Starikovskaya

Schlagwörter: Randomised algorithms, string similarity measures, longest common substring, sketching, locality-sensitive hashing

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.21

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.CPM.2016.21
https://nbn-resolving.org/urn:nbn:de:0030-drops-60720
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.21