Principles of Optimal Probabilistic Decision Tree Construction

FCS, pp. 116-122, 2006.

Cited by: 0|Bibtex|Views2|
EI
Keywords:
decision treeboolean functionindexing termsoptimization problem

Abstract:

Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give correct answer (but can also give nothing at all) and is not allowed to give wrong answers, but other always manages to give correct answer, but may require mo...More

Code:

Data:

Your rating :
0

 

Tags
Comments