Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Nguyen Thi My Binh
@inproceedings{DBLP:conf/adhocnets/BinhTLN23, author = {Nguyen Thi My Binh and Nguyen Van Thien and Ho Viet Duc Luong and Dang The Ngoc}, editor = {Nguyen Thi Dieu Linh and Manh Kha Hoang and Trong Hop Dang}, title = {An Efficient Approach to the k-Strong Barrier Coverage Problem Under the Probabilistic Sensing Model in Wireless Multimedia Sensor Networks}, booktitle = {Ad Hoc Networks - 14th {EAI} International Conference, AdHocNets 2023, Hanoi, Vietnam, November 10-11, 2023, Proceedings}, series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}, volume = {558}, pages = {167--180}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-55993-8\_13}, doi = {10.1007/978-3-031-55993-8\_13}, timestamp = {Fri, 19 Apr 2024 15:29:26 +0200}, biburl = {https://dblp.org/rec/conf/adhocnets/BinhTLN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/adhocnets/ThienBH23, author = {Nguyen Van Thien and Nguyen Thi My Binh and Dang Trong Hop}, editor = {Nguyen Thi Dieu Linh and Manh Kha Hoang and Trong Hop Dang}, title = {An Efficient Method for Solving the Best Coverage Path Problem in Homogeneous Wireless Ad-Hoc Sensor Networks}, booktitle = {Ad Hoc Networks - 14th {EAI} International Conference, AdHocNets 2023, Hanoi, Vietnam, November 10-11, 2023, Proceedings}, series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}, volume = {558}, pages = {181--195}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-55993-8\_14}, doi = {10.1007/978-3-031-55993-8\_14}, timestamp = {Fri, 19 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/adhocnets/ThienBH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eswa/BinhNBVY22, author = {Nguyen Thi My Binh and Nguyen Hong Ngoc and Huynh Thi Thanh Binh and Nguyen Khanh Van and Shui Yu}, title = {A family system based evolutionary algorithm for obstacle-evasion minimal exposure path problem in Internet of Things}, journal = {Expert Syst. Appl.}, volume = {200}, pages = {116943}, year = {2022}, url = {https://doi.org/10.1016/j.eswa.2022.116943}, doi = {10.1016/J.ESWA.2022.116943}, timestamp = {Fri, 30 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eswa/BinhNBVY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soict/BinhLNBP22, author = {Nguyen Thi My Binh and Dao Hoang Long and Nguyen Ngoc and Huynh Thi Thanh Binh and Nguyen Khanh Phuong}, title = {Investigate Evolutionary Strategies for Black-box Attacks to Deepfake Forensic Systems}, booktitle = {The 11th International Symposium on Information and Communication Technology, SoICT 2022, Hanoi, Vietnam, December 1-3, 2022}, pages = {126--133}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3568562.3568666}, doi = {10.1145/3568562.3568666}, timestamp = {Mon, 05 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soict/BinhLNBP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apin/BinhBLY20, author = {Nguyen Thi My Binh and Huynh Thi Thanh Binh and Nguyen Van Linh and Shui Yu}, title = {Efficient meta-heuristic approaches in solving minimal exposure path problem for heterogeneous wireless multimedia sensor networks in internet of things}, journal = {Appl. Intell.}, volume = {50}, number = {6}, pages = {1889--1907}, year = {2020}, url = {https://doi.org/10.1007/s10489-019-01628-9}, doi = {10.1007/S10489-019-01628-9}, timestamp = {Fri, 30 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apin/BinhBLY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sensors/BinhMBLST20, author = {Nguyen Thi My Binh and Abdelhamid Mellouk and Huynh Thi Thanh Binh and Le Vu Loi and Dang Lam San and Hai Anh Tran}, title = {An Elite Hybrid Particle Swarm Optimization for Solving Minimal Exposure Path Problem in Mobile Wireless Sensor Networks}, journal = {Sensors}, volume = {20}, number = {9}, pages = {2586}, year = {2020}, url = {https://doi.org/10.3390/s20092586}, doi = {10.3390/S20092586}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sensors/BinhMBLST20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/asc/BinhBNLN19, author = {Huynh Thi Thanh Binh and Nguyen Thi My Binh and Nguyen Hong Ngoc and Dinh Thi Ha Ly and Nguyen Duc Nghia}, title = {Efficient approximation approaches to minimal exposure path problem in probabilistic coverage model for wireless sensor networks}, journal = {Appl. Soft Comput.}, volume = {76}, pages = {726--743}, year = {2019}, url = {https://doi.org/10.1016/j.asoc.2018.12.022}, doi = {10.1016/J.ASOC.2018.12.022}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/asc/BinhBNLN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ssci/BinhTNB17, author = {Nguyen Thi My Binh and Chu Minh Thang and Nguyen Duc Nghia and Huynh Thi Thanh Binh}, title = {Genetic algorithm for solving minimal exposure path in mobile sensor networks}, booktitle = {2017 {IEEE} Symposium Series on Computational Intelligence, {SSCI} 2017, Honolulu, HI, USA, November 27 - Dec. 1, 2017}, pages = {1--8}, publisher = {{IEEE}}, year = {2017}, url = {https://doi.org/10.1109/SSCI.2017.8285402}, doi = {10.1109/SSCI.2017.8285402}, timestamp = {Wed, 16 Oct 2019 14:14:56 +0200}, biburl = {https://dblp.org/rec/conf/ssci/BinhTNB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.