Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Stephane Messika"'
Autor:
Defago, Xavier, Potop-Butucaru, Maria Gradinariu, Stephane Messika, Julien Clement, Raipin-Parvedy, Philippe
Publikováno v:
Research report (School of Information Science, Japan Advanced Institute of Science and Technology). :1-24
Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial locations and no initial agreement on a global coordinate system, gathering requires that all robots, following the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::9c9c5fa4e8c5f44bf15eee4c5bf11998
http://hdl.handle.net/10119/12611
http://hdl.handle.net/10119/12611
Publikováno v:
PODC
Distributed computing has to adapt its techniques to mobile sensor networks and cope with constraints like small memory size or lack of computation power. In this paper we extend the results of Angluin et al (see [1,2,3,4]) by finding self-stabilizin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91aa5222da42ed88f69aaedc989f23c1
https://doi.org/10.1145/1281100.1281191
https://doi.org/10.1145/1281100.1281191
Publikováno v:
Applied optics. 46(5)
We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5df87792666c02db821eb546e18eb795
https://pubmed.ncbi.nlm.nih.gov/17279159
https://pubmed.ncbi.nlm.nih.gov/17279159
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540490180
SSS
Stabilization, Safety, and Security of Distributed Systems
8th International Symposium, SSS 2006
8th International Symposium, SSS 2006, Nov 2006, Dallas, Texas, United States. pp.82-94, ⟨10.1007/978-3-540-49823-0_6⟩
SSS
Stabilization, Safety, and Security of Distributed Systems
8th International Symposium, SSS 2006
8th International Symposium, SSS 2006, Nov 2006, Dallas, Texas, United States. pp.82-94, ⟨10.1007/978-3-540-49823-0_6⟩
International audience; We reduce the problem of proving the convergence of a randomized self-stabilizing algorithm under k-bounded policies to the convergence of the same algorithm under a specific policy. As a consequence, all k-bounded schedules a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d64a8392cc07fbfebe3e6af3e0dde556
https://doi.org/10.1007/978-3-540-49823-0_6
https://doi.org/10.1007/978-3-540-49823-0_6
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540446248
DISC
20th International Symposium on Distributed Computing (DISC)
20th International Symposium on Distributed Computing (DISC), Sep 2006, Stockolm, Sweden. pp.46-60, ⟨10.1007/11864219_4⟩
DISC
20th International Symposium on Distributed Computing (DISC)
20th International Symposium on Distributed Computing (DISC), Sep 2006, Stockolm, Sweden. pp.46-60, ⟨10.1007/11864219_4⟩
International audience; Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial location and no initial agreement on a global coordinate system, gathering requires that al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00cec5ddebbdb4b328394f746d7e2e53
https://doi.org/10.1007/11864219_4
https://doi.org/10.1007/11864219_4
Publikováno v:
Optical Engineering. 46:108201
An optical method for synthesizing a binary matrix representing all feasible solutions of a bounded (input length restricted) NP-complete combinatorial problem is presented. After the preparation of this matrix, an optical matrix-vector multiplier ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27830fbd3f8c8880ceb0e07cd892ee49
https://doi.org/10.1117/1.2799086
https://doi.org/10.1117/1.2799086
Publikováno v:
Optical Engineering; Oct2007, Vol. 46 Issue 10, p10820-10820, 1p