The ANTS problem (Q2401118): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Beeping a maximal independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Biological Solution to a Fundamental Distributed Computing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many Random Walks Are Faster Than One / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Co-evolution of learning complexity and social foraging strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The harmonic <i>k</i> -server algorithm is competitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Random Walks in Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online searching with turn cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal graph exploration without good maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the cover time of multiple random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the ANTS Problem with Asynchronous Finite State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Many Ants Does It Take to Find the Food? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stone age distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collaborative search on the plane without communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remembering without memory: tree exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many oblivious robots can explore a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective tree exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computing with advice: information sensitivity of graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local MST computation with short advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory for local distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel exhaustive search without coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with logarithmic memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of closed invariant sets of semidynamical systems. The method of sign definite Lyapunov functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward more localized local algorithms: removing assumptions concerning global knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed verification of minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel search with no coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-offs between selection complexity and performance when searching the plane without communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaten in planaren Graphen / rank
 
Normal rank

Latest revision as of 08:55, 14 July 2024

scientific article
Language Label Description Also known as
English
The ANTS problem
scientific article

    Statements

    The ANTS problem (English)
    0 references
    0 references
    0 references
    31 August 2017
    0 references
    search algorithms
    0 references
    memory bounds
    0 references
    advice complexity
    0 references
    mobile robots
    0 references
    speed-up
    0 references
    cow-path problem
    0 references
    online algorithms
    0 references
    quorum sensing
    0 references
    social insects
    0 references
    central place foraging
    0 references
    ants
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references