-
1دورية أكاديمية
المؤلفون: Xiao Qun Liao, Tong Su, Li Ma
المصدر: CAAI Transactions on Intelligence Technology (2020)
مصطلحات موضوعية: distribution networks, linear programming, trees (mathematics), genetic algorithms, set theory, real-life problems, neutrosophic mst problem, linear programming model, neutrosophic minimum spanning tree, electrical power distribution network, combinatorial optimisation problems, graph theory, triangular neutrosophic, Computational linguistics. Natural language processing, P98-98.5, Computer software, QA76.75-76.765
وصف الملف: electronic resource
-
2دورية أكاديمية
المؤلفون: Kandasamy Ilanthenral
المصدر: Journal of Intelligent Systems, Vol 27, Iss 2, Pp 163-182 (2018)
مصطلحات موضوعية: neutrosophic set, double-valued neutrosophic set (dvns), minimum spanning tree (mst), clustering algorithm, double-valued neutrosophic minimum spanning tree (dvn-mst) clustering algorithm, 62h30, 05c90, 03b52, 03b60, Science, Electronic computers. Computer science, QA75.5-76.95
وصف الملف: electronic resource
-
3
المؤلفون: Ilanthenral Kandasamy
المصدر: Journal of Intelligent Systems, Vol 27, Iss 2, Pp 163-182 (2018)
مصطلحات موضوعية: 05c90, 0209 industrial biotechnology, Computer science, Science, Neutrosophic set, Single-linkage clustering, 02 engineering and technology, Minimum spanning tree, 020901 industrial engineering & automation, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, 03b52, Double-Valued Neutrosophic Set, Cluster analysis, minimum spanning tree (mst), double-valued neutrosophic minimum spanning tree (dvn-mst) clustering algorithm, 62h30, double-valued neutrosophic set (dvns), Spanning tree, business.industry, Pattern recognition, QA75.5-76.95, clustering algorithm, Electronic computers. Computer science, Reverse-delete algorithm, 020201 artificial intelligence & image processing, Artificial intelligence, 03b60, Indeterminate, business, Software, Information Systems
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e41fb311330cfe17d654107bcd8ad8c