FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4384705469> ?p ?o ?g. }

• W4384705469 abstract "Over the years, much research involving mobile computational entities has been performed. From modeling actual microscopic (and smaller) robots, to modeling software processes on a network, many important problems have been studied in this context. Gathering is one such fundamental problem in this area. The problem of gathering k robots, initially arbitrarily placed on the nodes of an n-node graph, asks that these robots coordinate and communicate in a local manner, as opposed to global, to move around the graph, find each other, and settle down on a single node as fast as possible. A more difficult problem to solve is gathering with detection, where once the robots gather, they must subsequently realize that gathering has occurred and then terminate.In this paper, we propose a deterministic approach to solve gathering with detection for any arbitrary connected graph that is faster than existing deterministic solutions for even just gathering (without the requirement of detection) for arbitrary graphs. In contrast to earlier work on gathering, it leverages the fact that there are more robots present in the system to achieve gathering with detection faster than those previous papers that focused on just gathering. The state of the art solution for deterministic gathering [Ta-Shma and Zwick, TALG, 2014] takes $tilde Oleft({{n^5}log ell }right)$ rounds, where is the smallest label among robots and $tilde O$ hides a polylog factor. We design a deterministic algorithm for gathering with detection with the following trade-offs depending on how many robots are present: (i) when k ≥ ⌊n/2⌋ + 1, the algorithm takes O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sup> ) rounds, (ii) when k ≥ ⌊n/3⌋ + 1, the algorithm takes O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>4</sup> log n) rounds, and (iii) otherwise, the algorithm takes $tilde Oleft({{n^5}}right)$ rounds. The algorithm is not required to know k, but only n." @default.
• W4384705469 created "2023-07-20" @default.
• W4384705469 creator A5018807670 @default.
• W4384705469 creator A5059765803 @default.
• W4384705469 creator A5070835473 @default.
• W4384705469 date "2023-05-01" @default.
• W4384705469 modified "2023-09-26" @default.
• W4384705469 title "Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots" @default.
• W4384705469 cites W1483270512 @default.
• W4384705469 cites W155018373 @default.
• W4384705469 cites W1969099455 @default.
• W4384705469 cites W1969585469 @default.
• W4384705469 cites W1988889787 @default.
• W4384705469 cites W2003811039 @default.
• W4384705469 cites W2015331738 @default.
• W4384705469 cites W2039936247 @default.
• W4384705469 cites W2077415032 @default.
• W4384705469 cites W2087073465 @default.
• W4384705469 cites W2102334337 @default.
• W4384705469 cites W2114858735 @default.
• W4384705469 cites W2119517221 @default.
• W4384705469 cites W2128634904 @default.
• W4384705469 cites W2131666042 @default.
• W4384705469 cites W2138881680 @default.
• W4384705469 cites W2147342018 @default.
• W4384705469 cites W2207472552 @default.
• W4384705469 cites W2294959121 @default.
• W4384705469 cites W2494454782 @default.
• W4384705469 cites W2603214747 @default.
• W4384705469 cites W2909216346 @default.
• W4384705469 cites W2909916866 @default.
• W4384705469 cites W2963426245 @default.
• W4384705469 cites W2984471501 @default.
• W4384705469 cites W3046592195 @default.
• W4384705469 cites W3047375952 @default.
• W4384705469 cites W3136290985 @default.
• W4384705469 cites W3177377911 @default.
• W4384705469 cites W3182674124 @default.
• W4384705469 cites W404046798 @default.
• W4384705469 cites W4206997332 @default.
• W4384705469 cites W4230517044 @default.
• W4384705469 cites W599153350 @default.
• W4384705469 cites W2909363472 @default.
• W4384705469 doi "https://doi.org/10.1109/ipdps54959.2023.00015" @default.
• W4384705469 hasPublicationYear "2023" @default.
• W4384705469 type Work @default.
• W4384705469 citedByCount "0" @default.
• W4384705469 crossrefType "proceedings-article" @default.
• W4384705469 hasAuthorship W4384705469A5018807670 @default.
• W4384705469 hasAuthorship W4384705469A5059765803 @default.
• W4384705469 hasAuthorship W4384705469A5070835473 @default.
• W4384705469 hasConcept C105795698 @default.
• W4384705469 hasConcept C11413529 @default.
• W4384705469 hasConcept C120314980 @default.
• W4384705469 hasConcept C127413603 @default.
• W4384705469 hasConcept C132525143 @default.
• W4384705469 hasConcept C133462117 @default.
• W4384705469 hasConcept C13533509 @default.
• W4384705469 hasConcept C151730666 @default.
• W4384705469 hasConcept C154945302 @default.
• W4384705469 hasConcept C19966478 @default.
• W4384705469 hasConcept C2779343474 @default.
• W4384705469 hasConcept C33923547 @default.
• W4384705469 hasConcept C41008148 @default.
• W4384705469 hasConcept C62611344 @default.
• W4384705469 hasConcept C66938386 @default.
• W4384705469 hasConcept C80444323 @default.
• W4384705469 hasConcept C86803240 @default.
• W4384705469 hasConcept C90509273 @default.
• W4384705469 hasConceptScore W4384705469C105795698 @default.
• W4384705469 hasConceptScore W4384705469C11413529 @default.
• W4384705469 hasConceptScore W4384705469C120314980 @default.
• W4384705469 hasConceptScore W4384705469C127413603 @default.
• W4384705469 hasConceptScore W4384705469C132525143 @default.
• W4384705469 hasConceptScore W4384705469C133462117 @default.
• W4384705469 hasConceptScore W4384705469C13533509 @default.
• W4384705469 hasConceptScore W4384705469C151730666 @default.
• W4384705469 hasConceptScore W4384705469C154945302 @default.
• W4384705469 hasConceptScore W4384705469C19966478 @default.
• W4384705469 hasConceptScore W4384705469C2779343474 @default.
• W4384705469 hasConceptScore W4384705469C33923547 @default.
• W4384705469 hasConceptScore W4384705469C41008148 @default.
• W4384705469 hasConceptScore W4384705469C62611344 @default.
• W4384705469 hasConceptScore W4384705469C66938386 @default.
• W4384705469 hasConceptScore W4384705469C80444323 @default.
• W4384705469 hasConceptScore W4384705469C86803240 @default.
• W4384705469 hasConceptScore W4384705469C90509273 @default.
• W4384705469 hasLocation W43847054691 @default.
• W4384705469 hasOpenAccess W4384705469 @default.
• W4384705469 hasPrimaryLocation W43847054691 @default.
• W4384705469 hasRelatedWork W1485627940 @default.
• W4384705469 hasRelatedWork W1587227328 @default.
• W4384705469 hasRelatedWork W2122871747 @default.
• W4384705469 hasRelatedWork W2138266152 @default.
• W4384705469 hasRelatedWork W2160425906 @default.
• W4384705469 hasRelatedWork W2950537519 @default.
• W4384705469 hasRelatedWork W2998813341 @default.
• W4384705469 hasRelatedWork W3196755225 @default.
• W4384705469 hasRelatedWork W4298228310 @default.
• W4384705469 hasRelatedWork W4323323198 @default.

• next