Test, Teachers, Quorum (Pure Populations)

Radev, Slavian. "Test, Teachers, Quorum (Pure Populations)." Serdica Journal of Computing 7.3 (2013): 215-226. <http://eudml.org/doc/268671>.

@article{Radev2013,
abstract = {The “trial and error” method is fundamental for Master Minddecision algorithms. On the basis of Master Mind games and strategies weconsider some data mining methods for tests using students as teachers.Voting, twins, opposite, simulate and observer methods are investigated.For a pure data base these combinatorial algorithms are faster then manyAI and Master Mind methods. The complexities of these algorithms arecompared with basic combinatorial methods in AI. ACM Computing Classification System (1998): F.3.2, G.2.1, H.2.1, H.2.8, I.2.6.},
author = {Radev, Slavian},
journal = {Serdica Journal of Computing},
keywords = {Voting; Game; Observer; Data Mining; Test; Master Mind},
language = {eng},
number = {3},
pages = {215-226},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Test, Teachers, Quorum (Pure Populations)},
url = {http://eudml.org/doc/268671},
volume = {7},
year = {2013},
}

TY - JOUR
AU - Radev, Slavian
TI - Test, Teachers, Quorum (Pure Populations)
JO - Serdica Journal of Computing
PY - 2013
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 7
IS - 3
SP - 215
EP - 226
AB - The “trial and error” method is fundamental for Master Minddecision algorithms. On the basis of Master Mind games and strategies weconsider some data mining methods for tests using students as teachers.Voting, twins, opposite, simulate and observer methods are investigated.For a pure data base these combinatorial algorithms are faster then manyAI and Master Mind methods. The complexities of these algorithms arecompared with basic combinatorial methods in AI. ACM Computing Classification System (1998): F.3.2, G.2.1, H.2.1, H.2.8, I.2.6.
LA - eng
KW - Voting; Game; Observer; Data Mining; Test; Master Mind
UR - http://eudml.org/doc/268671
ER -