Searching with mobile agents in networks with liars.

DOI10.1016/S0166-218X(03)00189-6MaRDI QIDQ1422406zbMATH OpenOpenAlexFDO

Authors Nicolas Hanusse, Evangelos Kranakis, D. Krizanc

Publication date 14 February 2004

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(03)00189-6

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35)

Recommendations

• Memoryless search algorithms in a network with faulty advice
• Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
• scientific article; zbMATH DE number 1696681
• Mutual search
• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory

Cites work

• scientific article; zbMATH DE number 1696681 (Why is no real title available?)
• scientific article; zbMATH DE number 1303562 (Why is no real title available?)
• scientific article; zbMATH DE number 1303571 (Why is no real title available?)
• scientific article; zbMATH DE number 1306888 (Why is no real title available?)
• scientific article; zbMATH DE number 686998 (Why is no real title available?)
• scientific article; zbMATH DE number 1559557 (Why is no real title available?)
• Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
• Interval graphs and searching
• Monotonicity in graph searching
• Searching in the plane
• Searching with mobile agents in networks with liars.
• The complexity of searching a graph

Cited in

(9)

• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
• Searching a Tree with Permanently Noisy Advice
• Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
• Searching with mobile agents in networks with liars.
• Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval
• Searching for searchers
• Memoryless search algorithms in a network with faulty advice
• The impact of dynamic events on the number of errors in networks
• scientific article; zbMATH DE number 1696681 (Why is no real title available?)

This page was built for publication: Searching with mobile agents in networks with liars.

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