Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Morten Mjelde"'
Publikováno v:
Proceedings of the 28th International Conference on Intelligent User Interfaces.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53029ce65c6f6647cbc43263dd304a8c
https://doi.org/10.1145/3581641.3584093
https://doi.org/10.1145/3581641.3584093
Publikováno v:
Theoretical Computer Science. 412:5515-5526
The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and the self-stabilizing literature. Previous work has resulted in self-stabilizing algorithms for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c25616b11d4487be8b37e4031224ea3
https://doi.org/10.1016/j.tcs.2011.05.019
https://doi.org/10.1016/j.tcs.2011.05.019
Autor:
Rodica Mihai, Morten Mjelde
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642051173
SSS
SSS
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving along the edges of the graph. In this paper we consider the graph searchin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea3ff1bb0962449fb45a0da473fbcfdc
https://doi.org/10.1007/978-3-642-05118-0_39
https://doi.org/10.1007/978-3-642-05118-0_39
Publikováno v:
International Conference on Stabilization, Safety, and Security (SSS 2008)
International Conference on Stabilization, Safety, and Security (SSS 2008), Nov 2008, Detroit, MI, United States. pp.94-108, ⟨10.1007/978-3-540-89335-6_10⟩
Lecture Notes in Computer Science ISBN: 9783540893349
Theoretical Computer Science
Theoretical Computer Science, 2011, 412 (40), pp.5515-5526. ⟨10.1016/j.tcs.2011.05.019⟩
Theoretical Computer Science, Elsevier, 2011, 412 (40), pp.5515-5526. ⟨10.1016/j.tcs.2011.05.019⟩
International Conference on Stabilization, Safety, and Security (SSS 2008), Nov 2008, Detroit, MI, United States. pp.94-108, ⟨10.1007/978-3-540-89335-6_10⟩
Lecture Notes in Computer Science ISBN: 9783540893349
Theoretical Computer Science
Theoretical Computer Science, 2011, 412 (40), pp.5515-5526. ⟨10.1016/j.tcs.2011.05.019⟩
Theoretical Computer Science, Elsevier, 2011, 412 (40), pp.5515-5526. ⟨10.1016/j.tcs.2011.05.019⟩
International audience; The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and self-stabilizing literature. Previous work has resulted in self-stabil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36bc6daae55b205cd278194d54942061
https://hal.archives-ouvertes.fr/hal-01303005
https://hal.archives-ouvertes.fr/hal-01303005
Autor:
Fredrik Manne, Morten Mjelde
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540766261
SSS
SSS
The problem of computing a matching in a graph involves creating pairs of neighboring nodes such that no node is paired more than once. Previous work on the matching problem has resulted in several selfstabilizing algorithms for finding a maximal mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78ab1795d3f3f5335517f72441f20223
https://doi.org/10.1007/978-3-540-76627-8_29
https://doi.org/10.1007/978-3-540-76627-8_29
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540766261
SSS
SSS
Sensor networks are composed of nodes embedded in physical environments where applications may be tasked to run for years without human maintenance and without continuous external power supply. Strategies for power conservation are thus important in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23d956258f289cfd670b99697035d9ba
https://doi.org/10.1007/978-3-540-76627-8_25
https://doi.org/10.1007/978-3-540-76627-8_25
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2009, 410 (14), pp.1336-1345. ⟨10.1016/j.tcs.2008.12.022⟩
Theoretical Computer Science, Elsevier, 2009, 410 (14), pp.1336-1345. ⟨10.1016/j.tcs.2008.12.022⟩
Theoretical Computer Science, 2009, 410 (14), pp.1336-1345. ⟨10.1016/j.tcs.2008.12.022⟩
Theoretical Computer Science, Elsevier, 2009, 410 (14), pp.1336-1345. ⟨10.1016/j.tcs.2008.12.022⟩
International audience; The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given several self-stabilizing algorithms that solve the problem for both the adversarial and the fair distr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::430032d11091c639b219a1096179c392
http://arxiv.org/abs/cs/0701189
http://arxiv.org/abs/cs/0701189
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783540729181
SIROCCO
SIROCCO
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon, the sequen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd997eca6ce8c2c33fcf42c34e724483
https://doi.org/10.1007/978-3-540-72951-8_9
https://doi.org/10.1007/978-3-540-72951-8_9