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...

Celý popis

Podrobná bibliografia

Vydané v:	Lecture notes in engineering and computer science Ročník 2233/2234; s. 185
Hlavný autor:	Suzuki, Toshio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hong Kong International Association of Engineers 14.03.2018
Predmet:	Algorithms Channels Communication channels Interruption Leaves Search algorithms
ISSN:	2078-0958, 2078-0966
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!