Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Evangelos Kranakis / rank
Normal rank
 
Property / author
 
Property / author: Toshinori Sakai / rank
Normal rank
 
Property / author
 
Property / author: Evangelos Kranakis / rank
 
Normal rank
Property / author
 
Property / author: Toshinori Sakai / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-72751-6_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2781064802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collaboration Without Communication: Evacuating Two Robots from a Disk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evacuating Robots via Unknown Exit in a Disk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of asynchronous robots with limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering asynchronous oblivious mobile robots in a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:05, 31 July 2024

scientific article; zbMATH DE number 7631537
Language Label Description Also known as
English
Searching for a Non-adversarial, Uncooperative Agent on a Cycle
scientific article; zbMATH DE number 7631537

    Statements

    Searching for a Non-adversarial, Uncooperative Agent on a Cycle (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2022
    0 references
    cycle
    0 references
    direction of movement
    0 references
    moving bus
    0 references
    robot
    0 references
    search
    0 references
    speed
    0 references

    Identifiers