scientific article; zbMATH DE number 2006652

zbMATH Open1024.68515MaRDI QIDQ4436050

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (1)

k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems

Recommendations

• A note on randomized mutual search. 👍 👎
• k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems 👍 👎
• Searching by heterogeneous agents 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: