An AND-OR-Tree Connected to Leaves via Communication Channels

We introduce a successor model of an AND-OR tree. Leaves are connected to internal nodes via communication channels that possibly have high probability of interruption. By depth-first communication we mean the following protocol: if a given algorithm probes a leaf then it continues to make queries t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Lecture notes in engineering and computer science Jg. 2233/2234; S. 185
1. Verfasser:	Suzuki, Toshio
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hong Kong International Association of Engineers 14.03.2018
Schlagworte:	Algorithms Channels Communication channels Interruption Leaves Search algorithms
ISSN:	2078-0958, 2078-0966
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!