Suchergebnisse - Round-based algorithm

Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata

Autoren: Tom Baumeister Paul Eichler Swen Jacobs et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783031711619

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC)

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

Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata

Autoren: Baumeister, Tom Eichler, Paul Jacobs, Swen et al.

Index Begriffe: Computer Science - Distributed, Parallel, and Cluster Computing, text

URL: http://arxiv.org/abs/2406.19880

Reductions and abstractions for formal verification of distributed round-based algorithms

Autoren: Raul Barbosa Alcides Fonseca Filipe Araujo

Quelle: Software Quality Journal. 29:705-731

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://link.springer.com/article/10.1007/s11219-020-09539-6
https://dblp.uni-trier.de/db/journals/sqj/sqj29.html#BarbosaFA21
https://www.scilit.net/article/2bd80bfe36559dc7403280f8a5dd6e7e?action=show-references

Round Based Extension Algorithm for Gossip Learning

Autoren: Radu Danescu Szabolcs-Marton Bagoly

Quelle: 2020 IEEE 16th International Conference on Intelligent Computer Communication and Processing (ICCP). :251-257

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://dblp.uni-trier.de/db/conf/iccp2/iccp2020.html#BagolyD20

Intelligent TRIPLE DES with N Round Based on Genetic Algorithm

Autoren: Mazin Haithem Rana Abdul Rahman Lateef

Quelle: Iraqi Journal of Science. :2058-2066

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://ijs.uobaghdad.edu.iq/index.php/eijs/article/download/552/616

Model Checking Round-Based Distributed Algorithms

Autoren: An, X. Pang, Jun

Quelle: 2010 15th IEEE International Conference on Engineering of Complex Computer Systems. :127-135

Schlagwörter: Computer science [C05] [Engineering, computing & technology], 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Sciences informatiques [C05] [Ingénierie, informatique & technologie], 01 natural sciences

Zugangs-URL: https://orbilu.uni.lu/bitstream/10993/192/1/ICECCS10.pdf
http://ieeexplore.ieee.org/document/5628621/
http://satoss.uni.lu/members/jun/papers/ICECCS10.pdf
https://dblp.uni-trier.de/db/conf/iceccs/iceccs2010.html#AnP10
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005628621
https://ieeexplore.ieee.org/document/5628621/
https://orbilu.uni.lu/handle/10993/192
http://orbilu.uni.lu/handle/10993/192

Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata - Artifact ; Symbolic Abstractions for Verifying Extended Threshold Automata

Autoren: Baumeister, Tom orcid:0009-0009-8539- Eichler, Paul et al.

Schlagwörter: threshold automata, formal methods, verification, distributed algorithms

Relation: arXiv:2406.19880; https://zenodo.org/records/15424668; oai:zenodo.org:15424668; https://doi.org/10.5281/zenodo.15424668

Verfügbarkeit: https://doi.org/10.5281/zenodo.15424668
https://zenodo.org/records/15424668

A Round-Based Cover Traffic Algorithm for Anonymity Systems

Autoren: Marta Rybczynska

Quelle: Studies in Computational Intelligence ISBN: 9783642167928

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://ieeexplore.ieee.org/document/5370923/
http://rybczynska.net/papers/Rybczynska-Round_based-incos2009.pdf
https://rd.springer.com/chapter/10.1007/978-3-642-16793-5_12
https://link.springer.com/chapter/10.1007/978-3-642-16793-5_12
http://ieeexplore.ieee.org/document/5370923/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005370923

Parameterized safety verification of round-based shared-memory systems

Autoren: Bertrand, Nathalie Markey, Nicolas Sankur, Ocan et al.

Weitere Verfasser: Bertrand, Nathalie Markey, Nicolas Sankur, Ocan et al.

Schlagwörter: FOS: Computer and information sciences, Model checking, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Formal Languages and Automata Theory (cs.FL), Verification, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO), Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, Parameterized models, [INFO.INFO-MA] Computer Science [cs]/Multiagent Systems [cs.MA], Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2204.11670
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.113

Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata - Artifact

Autoren: Baumeister, Tom orcid:0009-0009-8539- Eichler, Paul et al.

Schlagwörter: threshold automata, formal methods, verification, distributed algorithms

Relation: arXiv:2406.19880; https://zenodo.org/records/13788769; oai:zenodo.org:13788769; https://doi.org/10.5281/zenodo.13788769

Verfügbarkeit: https://doi.org/10.5281/zenodo.13788769
https://zenodo.org/records/13788769

A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

Autoren: Chaouch-Saad, Mouna Charron-Bost, Bernadette Merz, Stephan et al.

Weitere Verfasser: Chaouch-Saad, Mouna Charron-Bost, Bernadette Merz, Stephan et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783642044199

Schlagwörter: distributed computing, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], 0202 electrical engineering, electronic engineering, information engineering, Heard-Of model, 0102 computer and information sciences, 02 engineering and technology, formal verification, 16. Peace & justice, 01 natural sciences, fault-tolerance

Zugangs-URL: http://www.loria.fr/~merz/papers/rp2009.pdf
https://rd.springer.com/chapter/10.1007/978-3-642-04420-5_10
https://members.loria.fr/SMerz/papers/rp2009.pdf
https://dblp.uni-trier.de/db/conf/rp/rp2009.html#Chaouch-SaadCM09
https://link.springer.com/10.1007/978-3-642-04420-5_10
https://link.springer.com/chapter/10.1007%2F978-3-642-04420-5_10

Reductions and abstractions for formal verification of distributed round-based algorithms.

Autoren: Barbosa, Raul Fonseca, Alcides Araujo, Filipe

Quelle: Software Quality Journal; Sep2021, Vol. 29 Issue 3, p705-731, 27p

Schlagwörter: MAGNITUDE (Mathematics), PETRI nets, ALGORITHMS, DISTRIBUTED algorithms, SYMMETRY

An Energy-Efficient and Balanced Method for Centralized Clustering Routing Protocol in Wireless Sensor Networks.

Autoren: KARIMI, HAMID

Quelle: Adhoc & Sensor Wireless Networks; 2025, Vol. 60 Issue 1/2, p97-116, 20p

Schlagwörter: WIRELESS sensor networks, ROUTING algorithms, ENERGY consumption, EARLY death, CONVEX functions

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Autoren: Fatemeh Borran

Schlagwörter: distributed algorithms, modèle 'heard-of', consensus problem, round model, partial synchrony, heard-of model, decentralized algorithms, algorithmes décentralisés, wireless ad hoc networks, consensus Byzantin, algorithmes en rondes, swift algorithms, système partiellement synchrone, problème de consensus, quantitative analysis, tolérance aux fautes, algorithmes distribués, Byzantine consensus, algorithmes avec leader, modèle en rondes, algorithmes 'swift', round-based algorithms, analyse quantitative, leader-based algorithms, fault tolerance, réseau ad hoc sans fil

Zugangs-URL: https://infoscience.epfl.ch/record/151491

Smart Hardening for Round-based Encryption Algorithms: Application to Advanced Encryption Standard

Autoren: Enrique San Millan Marta Portela-Garcia Luis Entrena et al.

Quelle: 2008 14th IEEE International On-Line Testing Symposium. :167-168

Schlagwörter: 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4567081
http://doi.ieeecomputersociety.org/10.1109/IOLTS.2008.42
https://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4567081
https://www.computer.org/csdl/proceedings-article/iolts/2008/3264a167/12OmNBTs7ra
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004567081
https://dblp.uni-trier.de/db/conf/iolts/iolts2008.html#Lopez-OngilJPGME08

Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound

Autoren: Mostefaoui, Achour Raynal, Michel Travers, Corentin

Weitere Verfasser: Mostefaoui, Achour Raynal, Michel Travers, Corentin

Quelle: Theoretical Computer Science. 411:58-69

Schlagwörter: Consensus, Lower bound, t-resilience, Efficiency, 0102 computer and information sciences, 02 engineering and technology, Set agreement, 01 natural sciences, Synchronous system, Theoretical Computer Science, t-Resilience, Round-based algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Computer Science(all)

Zugangs-URL: https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#MostefaouiRT10
https://www.sciencedirect.com/science/article/pii/S030439750900629X
https://hal.archives-ouvertes.fr/hal-00543282

A distributed convergecast algorithm for dynamic mobile networks

Autoren: Agon-Rambosson, Aymeric Lejeune, Jonathan Sopena, Julien et al.

Weitere Verfasser: Agon-Rambosson, Aymeric Lejeune, Jonathan Sopena, Julien et al.

Quelle: 2024 IEEE 30th International Conference on Parallel and Distributed Systems (ICPADS). :42-51

Schlagwörter: Message aggregation, OLSR, Consensus, Distribution convergente, Agrégation des messages, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Convergecast, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], MANET, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Réseau mobile ad hoc

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-05274338v1/document
https://doi.org/10.1109/icpads63350.2024.00016
https://hal.science/hal-05274338v1

Intelligent TRIPLE DES with N Round Based on Genetic Algorithm.

Alternate Title: التشفير الثلاثي القياسي الذكي مع عدد غير محدد من الدو ا رت اعتمادا على الخهارزمية الجينية (Arabic)

Autoren: Haithem, Mazin Rahman Lateef, Rana Abdul

Quelle: Iraqi Journal of Science; 2019, Vol. 60 Issue 9, p2058-2066, 9p

Schlagwörter: GENETIC algorithms, PRIVACY, CIPHER & telegraph codes, CRYPTOGRAPHY, INFORMATION technology security

The role of local steps in local SGD.

Autoren: Qin, Tiancheng Etesami, S. Rasoul Uribe, César A.

Quelle: Optimization Methods & Software; Oct2025, Vol. 40 Issue 5, p1017-1043, 27p

Schlagwörter: COMMUNICATION complexity (Information theory), OPTIMIZATION algorithms, MATHEMATICAL functions, PARALLEL programming

Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice

Autoren: Tanaka, Yusei

Schlagwörter: FOS: Computer and information sciences, Cryptography and Security, Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Cryptography and Security (cs.CR)

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