scientific article; zbMATH DE number 2006652

MaRDI QIDQ4436050zbMATH OpenFDO

Authors Jaap-Henk Hoepman

Publication date 23 November 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2180/21800180.htm

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Recommendations

• k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems
• Multi-agent search in a set: distribution of effort and estimating the efficiency
• A note on randomized mutual search.
• scientific article; zbMATH DE number 7110187
• scientific article; zbMATH DE number 1303590

Cited in

(2)

• k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems
• A note on randomized mutual search.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436050)