Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Hoang Huu Viet"'
Publikováno v:
IEEE Access, Vol 11, Pp 89107-89123 (2023)
The co-authorship recommendation problem is attractive since it helps researchers extend collaboration to improve the quality of scientific articles as well as promote innovation. This problem involves suggesting authors join research groups based on
Externí odkaz:
https://doaj.org/article/dce41735d7a7433db256fb6851c0d032
Publikováno v:
Tạp chí Khoa học, Vol 51, Iss 3A, Pp 22-33 (2022)
This paper proposes an approximate search algorithm to solve the student-internship allocation problem. The key idea of the algorithm is that in each iteration, each student unassigned to an enterprise will be assigned to an enterprise where the stu
Externí odkaz:
https://doaj.org/article/64fc8069f06948c799d9ce09f0f487b5
Filtered-x Set Membership Algorithm With Time-Varying Error Bound for Nonlinear Active Noise Control
Autor:
Dinh Cong Le, Hoang Huu Viet
Publikováno v:
IEEE Access, Vol 10, Pp 90079-90091 (2022)
In order to reduce the computational complexity for nonlinear Active Noise Control (ANC) systems, we propose a filtered-x set membership with a time-varying error bound (Fx-SM-VEB) algorithm based on the adaptive approximation principle and data-sele
Externí odkaz:
https://doaj.org/article/491e9f0b109547069d59978999f22aff
Autor:
Le Hong Trang, Hoang Huu Viet
Publikováno v:
Vietnam Journal of Science and Technology. 60:257-269
The stable marriage problem (SMP) and its variants have received much attention in the literature due to their wide range of applications. One of their applications is resource allocation in network environments. In this paper, we consider two resour
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd7cd85062f60149a30bc7befa4792aa
https://doi.org/10.15625/2525-2518/16107
https://doi.org/10.15625/2525-2518/16107
Publikováno v:
Artificial Intelligence and Soft Computing ISBN: 9783031234910
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::050239b1873ee1607db4b3e7c26ffa30
https://doi.org/10.1007/978-3-031-23492-7_29
https://doi.org/10.1007/978-3-031-23492-7_29
Publikováno v:
Computational Data and Social Networks ISBN: 9783031263026
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb2ccd5dc04e77a6bca8dd7b7cff7ac2
https://doi.org/10.1007/978-3-031-26303-3_25
https://doi.org/10.1007/978-3-031-26303-3_25
Publikováno v:
Journal of Heuristics. 27:439-458
In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a weakly stable matching of maximum size for the stable marriage problem with ties and incomplete lists. The key idea of our approach is to define a heuristic f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf2089db29f60fb0d4b54429dba58c74
https://doi.org/10.1007/s10732-020-09464-8
https://doi.org/10.1007/s10732-020-09464-8
Publikováno v:
Journal of Computers. 15:1-9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ef08fea88a50f8194f7024da32dbacf
https://doi.org/10.17706/jcp.15.1.1-9
https://doi.org/10.17706/jcp.15.1.1-9
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030975456
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34e037b2ee4988c61db2462fd251bc43
https://doi.org/10.1007/978-3-030-97546-3_40
https://doi.org/10.1007/978-3-030-97546-3_40
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 32:147-163
This paper proposes a shortlist-based bidirectional local search algorithm to find an approximate solution for either the egalitarian or the sex-equal matching of the stable marriage problem. Our a...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f698f65871ca1cb913625640bb09d5c9
https://doi.org/10.1080/0952813x.2019.1635655
https://doi.org/10.1080/0952813x.2019.1635655