Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Slawomir Wierzchon"'
Autor:
Slawomir Wierzchon
Publikováno v:
Lecture Notes in Networks and Systems ISBN: 9789811911415
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c172ea43b3a4be0b542615a8406ad5fe
https://doi.org/10.1007/978-981-19-1142-2
https://doi.org/10.1007/978-981-19-1142-2
Autor:
Slawomir Wierzchon
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811902833
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4e06be244fed0e6937492a27c4c5450
https://doi.org/10.1007/978-981-19-0284-0
https://doi.org/10.1007/978-981-19-0284-0
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811950360
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2510ef1f9d689d78278ae174330bc439
https://doi.org/10.1007/978-981-19-5037-7
https://doi.org/10.1007/978-981-19-5037-7
Autor:
Slawomir Wierzchon
Publikováno v:
Lecture Notes in Networks and Systems ISBN: 9789811607325
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7424a8f7396591657ab310706da209a3
https://doi.org/10.1007/978-981-16-0733-2
https://doi.org/10.1007/978-981-16-0733-2
Autor:
Slawomir Wierzchon
Publikováno v:
Encyclopedia of Information Science and Technology, Third Edition ISBN: 9781466658882
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09767058325befac6c51889d757c8e19
https://doi.org/10.4018/978-1-4666-5888-2.ch162
https://doi.org/10.4018/978-1-4666-5888-2.ch162
Autor:
Slawomir Wierzchon
Publikováno v:
Advances in Soft Computing ISBN: 9783540335207
Advances in Soft Computing ISBN: 3540250565
Advances in Soft Computing ISBN: 3540250565
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc2b2039a7438ae809cd6ef4eae16d46
https://doi.org/10.1007/3-540-33521-8
https://doi.org/10.1007/3-540-33521-8
Publikováno v:
Scopus-Elsevier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b5f51706d7842c82a19db79c6099e4d0
http://www.scopus.com/inward/record.url?eid=2-s2.0-78650403408&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-78650403408&partnerID=MN8TOARS
Publikováno v:
Scopus-Elsevier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c2031aa2b3597c1794ea2bf0862f1181
http://www.scopus.com/inward/record.url?eid=2-s2.0-84855756981&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84855756981&partnerID=MN8TOARS
Publikováno v:
Scopus-Elsevier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5d909eb175d67218414db2411020be1d
http://www.scopus.com/inward/record.url?eid=2-s2.0-33750071699&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-33750071699&partnerID=MN8TOARS
Publikováno v:
Scopus-Elsevier
In the literature, the optimization problem to identify a set of composite hypotheses H, which will yield the $k$ largest $P(H|S_e)$ where a composite hypothesis is an instantiation of all the nodes in the network except the evidence nodes \cite{KSy:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ce50b173325daf35231d64d5b36f9eb
http://www.scopus.com/inward/record.url?eid=2-s2.0-0031167262&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-0031167262&partnerID=MN8TOARS