Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Thi Thanh Binh, Huynh"'
Autor:
Van Chien, Trinh, Trong Duc, Bui, Viet Duc Luong, Ho, Thi Thanh Binh, Huynh, Quoc Ngo, Hien, Chatzinotas, Symeon
Publikováno v:
IEEE Transactions on Wireless Communications; December 2024, Vol. 23 Issue: 12 p18838-18854, 17p
Publikováno v:
Evolutionary Intelligence.
In a complex network application, a set of nodes might be partitioned into multiple local clusters with different functions, properties, or communication protocols, and the communication is restricted between nodes of the same cluster to maximize eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c3076e8a83aa2ea5f4e5cb1d8e29ea7
https://doi.org/10.1007/s12065-023-00848-w
https://doi.org/10.1007/s12065-023-00848-w
Publikováno v:
SCC
In this paper, we first design a system that integrates a blockchain network into a fog-cloud environment to improve the transparency as well as avoid the attack from suspicious parties. We identify task scheduling as the most prominent and crucial i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b20d715d8a1b4008a890174f998051e
https://doi.org/10.1109/scc53864.2021.00065
https://doi.org/10.1109/scc53864.2021.00065
Autor:
Thu Lam Bui, Thi Thanh Binh Huynh, Ba Trung Tran, Minh Hai Phong Le, Dinh Thanh Pham, Cong Thanh Le, Ananthram Swami
Linkage Tree Genetic Algorithm (LTGA) is an effective Evolutionary Algorithm (EA) to solve complex problems using the linkage information between problem variables. LTGA performs well in various kinds of single-task optimization and yields promising
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d71445813940405ddc13f073a3cc8c71
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Xuan Thang Nguyen, Alexander Jahl, Ramaprasad Kuppili, Huu Tam Tran, Kurt Geihs, Thi Thanh Binh Huynh
Publikováno v:
SoICT
In the heterogeneous and dynamic Internet of Things (IoT), applications and services are frequently subject to change for various reasons such as maintaining their functionality, reliability, availability, and performance. Detecting and communicating
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53baca4cf64193332e39671b129c104e
https://doi.org/10.1145/3287921.3287979
https://doi.org/10.1145/3287921.3287979
Publikováno v:
SoICT
In multi-agent systems (MAS), plans consisting of sequences of actions are used to accomplish the team task. A critical issue for this approach is avoiding problems such as deadlocks and safety violations. Our recent work addresses that matter by ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58f29fcb3fee742149836ef2fa8ee142
https://doi.org/10.1145/3287921.3287947
https://doi.org/10.1145/3287921.3287947
Publikováno v:
2016 International Conference on Computational Intelligence and Cybernetics.
Traveling Salesman Problem (TSP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-Based Optimization Algorithm (BBO) is a new optimization technique, is inspired by geographical distribution of specie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::695e52e145922f4222a0a34037afca7e
https://doi.org/10.1109/cyberneticscom.2016.7892563
https://doi.org/10.1109/cyberneticscom.2016.7892563
Autor:
Dinh Thanh Pham, Thi Thanh Binh Huynh
Publikováno v:
TAAI
We investigate a mechanism of combining Genetic Algorithms (GA) and the Variable Neighborhood Search (VNS) for solving Traveling Salesman Problem (TSP). This combination aims to take advantage of GA's strength in exploring solution space and VNS's po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60931bd6009d7121e093e941adeda42b
https://doi.org/10.1109/taai.2015.7407102
https://doi.org/10.1109/taai.2015.7407102
Publikováno v:
TAAI
The Linear Ordering Problem (LOP) is a well-known NP-Hard problem and has many applications in various fields. In this paper, we propose two new crossover operators and a novel combination crossover operators in Genetic Algorithm (GA) for solving LOP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3fe0c2a95712550c002d5c4eede8e8d
https://doi.org/10.1109/taai.2015.7407081
https://doi.org/10.1109/taai.2015.7407081