Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Stéphane Messika"'
Publikováno v:
Techniques et sciences informatiques. 30:35-57
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0382dc2f83f1dc7a41a1583a463df17f
https://doi.org/10.3166/tsi.30.35-57
https://doi.org/10.3166/tsi.30.35-57
Publikováno v:
Distributed Computing. 18:221-232
A randomized self-stabilizing algorithm A is an algorithm that, whatever the initial configuration is, reaches a set L of legal configurations in finite time with probability 1. The proof of convergence towards L is generally done by exhibiting a pot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5289446a319db87c688711573925597
https://doi.org/10.1007/s00446-005-0142-7
https://doi.org/10.1007/s00446-005-0142-7
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540751410
DISC
DISC
Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computational power. In this paper, we extend the results of Angluin et al (see [4,3,2,1])
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21b2e5518c7e8a02ab3392ef8d3ca729
https://doi.org/10.1007/978-3-540-75142-7_8
https://doi.org/10.1007/978-3-540-75142-7_8
Publikováno v:
Distributed Computing
20th International Symposium of Distributed Computing, DISC 2006
20th International Symposium of Distributed Computing, DISC 2006, Oct 2006, Stockholm, Sweden. pp.543-547, ⟨10.1007/11864219_40⟩
Lecture Notes in Computer Science ISBN: 9783540446248
DISC
20th International Symposium of Distributed Computing, DISC 2006
20th International Symposium of Distributed Computing, DISC 2006, Oct 2006, Stockholm, Sweden. pp.543-547, ⟨10.1007/11864219_40⟩
Lecture Notes in Computer Science ISBN: 9783540446248
DISC
In this paper, we reduce the problem of computing the convergence time for a randomized self-stabilizing algorithm to an instance of the stochastic shortest path problem (SSP). The solution gives us a way to compute automatically the stabilization ti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1aa8f88f43327acf46ae8b685ff7cbf9
https://hal.archives-ouvertes.fr/hal-00355509
https://hal.archives-ouvertes.fr/hal-00355509
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540233060
DISC
DISC
A randomized self-stabilizing algorithm \({\cal A}\) is an algorithm that, whatever the initial configuration is, reaches a set \({\cal L}\) of legal configurations in finite time with probability 1. The proof of convergence towards \({\cal L}\) is g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46a57d6e98e28c3360a918605cadda73
https://doi.org/10.1007/978-3-540-30186-8_15
https://doi.org/10.1007/978-3-540-30186-8_15
Autor:
Thomas Herault, Sylvain Peyronnet, Claudine Picaronny, Marie Duflot, Stéphane Messika, Laurent Fribourg, Frédéric Magniette, Richard Lassaigne
Publikováno v:
Electronic Notes in Theoretical Computer Science. (6):195-214
Carrier Sense Multiple Access/Collision Detection (CSMA/CD) is the protocol for carrier transmission access in Ethernet networks (international standard IEEE 802.3). On Ethernet, any Network Interface Card (NIC) can try to send a packet in a channel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f7008fdccdeb22aac8f133b5da45512