Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Mingjie Lei"'
Publikováno v:
PeerJ Computer Science, Vol 10, p e2173 (2024)
The maximum clique problem in graph theory is a well-known challenge that involves identifying the complete subgraph with the highest number of nodes in a given graph, which is a problem that is hard for nondeterministic polynomial time (NP-hard prob
Externí odkaz:
https://doaj.org/article/3653ef7adff94170bab38da43e78ea6f
Autor:
Mulan Qin, Nannan Qin, Mingjie Lei, Dandan Ji, Wanmin Liu, Xinxin Cao, Guozhao Fang, Shuquan Liang
Publikováno v:
Journal of Electroanalytical Chemistry. 920:116613
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90b3a7d933a31f0a50af76cee2fece7e
https://doi.org/10.1016/j.jelechem.2022.116613
https://doi.org/10.1016/j.jelechem.2022.116613
Autor:
Yuanjie Bi1 skbyj123456@126.com, Pengpeng Lv1, Ruidong Su1, Yingmiao Wang1, Jian Wang1, Mingjie Lei2
Publikováno v:
Fresenius Environmental Bulletin. Jul2020, Issue 7, p5021-5028. 8p.
Publikováno v:
2009 International Conference on Measuring Technology and Mechatronics Automation.
Based on the fact that the Elman model of neural network can well approach any nonlinear continuous function and has ability to reflect dynamic features of the systems, a method of width spread to medium plate mill prediction by Elman model was prese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fbd7fa8fdaa529ba5f8d8b9aab3e704
https://doi.org/10.1109/icmtma.2009.259
https://doi.org/10.1109/icmtma.2009.259
Publikováno v:
PeerJ Computer Science; Jul2024, p1-23, 23p
Publikováno v:
Opera Now; Dec2023, p58-63, 6p
Autor:
Weber, J. F.
Publikováno v:
Fanfare: The Magazine for Serious Record Collectors. Nov/Dec2023, Vol. 47 Issue 2, p294-295. 2p.
Autor:
Dubins, Jerry
Publikováno v:
Fanfare: The Magazine for Serious Record Collectors. Nov/Dec2023, Vol. 47 Issue 2, p293-294. 2p.
Publikováno v:
Opera Now; Jun2023, p55-63, 9p