An evaluation ofalgol 68 for interrogation process algorithms


Given a random processT taking a finite number of statesT j on a population Ω, we consider a family,D, of random processes defined on Ω. Each elementq ofD has a finite number of possible statesq i, and we suppose that the conditional probabilitiesp(q i|T j) are known. We consider arborescent decision processes using the elements ofD as questions and aiming… (More)
DOI: 10.1007/BF01108519


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics