default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTa Bao Thang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Le Tien Thanh, Ta Bao Thang
, Le Van Cuong, Huynh Thi Thanh Binh:
Multitask Augmented Random Search in deep reinforcement learning. Appl. Soft Comput. 160: 111605 (2024)- [j7]Bao Thang Ta, Nhat Minh Le, Van Hai Do:
Transfer learning methods for low-resource speech accent recognition: A case study on Vietnamese language. Eng. Appl. Artif. Intell. 132: 107895 (2024) - [c10]Bao Thang Ta, Minh Khang Pham, Nhat Minh Le, Van Hai Do:
Human Behavior Modeling in Speech Transcribing Process via Pretrained Speech Recognition Models. IJCNN 2024: 1-6 - 2023
- [j6]Huynh Thi Thanh Binh, Le Van Cuong, Ta Bao Thang, Nguyen Hoang Long:
Ensemble Multifactorial Evolution With Biased Skill-Factor Inheritance for Many-Task Optimization. IEEE Trans. Evol. Comput. 27(6): 1735-1749 (2023) - [c9]Ngoc-Anh Nguyen Thi, Bao Thang Ta, Nhat Minh Le, Van Hai Do:
An Automatic Pipeline For Building Emotional Speech Dataset. APSIPA ASC 2023: 1030-1035 - [c8]Minh Tu Le, Bao Thang Ta, Nhat Minh Le, Phi Le Nguyen, Van Hai Do:
A Gaussian Distribution Labeling Method for Speech Quality Assessment. CSoNet 2023: 27-38 - [c7]Bao Thang Ta, Minh Tu Le, Nhat Minh Le, Van Hai Do:
Probing Speech Quality Information in ASR Systems. INTERSPEECH 2023: 541-545 - [c6]Dinh Son Dang, Tung Lam Nguyen, Bao Thang Ta, Tien Thanh Nguyen, Thi Ngoc Anh Nguyen, Dang Linh Le, Nhat Minh Le, Van Hai Do:
LightVoc: An Upsampling-Free GAN Vocoder Based On Conformer And Inverse Short-time Fourier Transform. INTERSPEECH 2023: 3043-3047 - 2022
- [j5]Ta Bao Thang, Huynh Thi Thanh Binh:
A hybrid multifactorial evolutionary algorithm and firefly algorithm for the clustered minimum routing cost tree problem. Knowl. Based Syst. 241: 108225 (2022) - [c5]Bao Thang Ta, Xuan Vuong Dang, Quang Tien Duong, Nhat Minh Le, Van Hai Do:
Improving Vietnamese Accent Recognition Using ASR Transfer Learning. O-COCOSDA 2022 2022: 1-6 - [c4]Quang Tien Duong, Duc Huy Nguyen, Bao Thang Ta, Nhat Minh Le, Van Hai Do:
Improving Self-supervised Audio Representation based on Contrastive Learning with Conformer Encoder. SoICT 2022: 270-275 - 2021
- [j4]Ta Bao Thang, Nguyen Binh Long, Ngo Viet Hoang, Huynh Thi Thanh Binh:
Adaptive Knowledge Transfer in Multifactorial Evolutionary Algorithm for the Clustered Minimum Routing Cost Problem. Appl. Soft Comput. 105: 107253 (2021) - [j3]Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh:
A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization. Eng. Appl. Artif. Intell. 100: 104187 (2021) - [j2]Ta Bao Thang, Tran Cong Dao, Nguyen Hoang Long, Huynh Thi Thanh Binh:
Parameter adaptation in multifactorial evolutionary algorithm for many-task optimization. Memetic Comput. 13(4): 433-446 (2021) - [c3]Do Tuan Anh, Huynh Thi Thanh Binh, Nguyen Hoang Long, Ta Bao Thang, Simon Su:
A Two-level Genetic Algorithm for Inter-domain Path Computation under Node-defined Domain Uniqueness Constraints. CEC 2021: 87-94 - [c2]Le Tien Thanh, Le Van Cuong, Ta Bao Thang, Huynh Thi Thanh Binh:
Multi-Armed Bandits for Many-Task Evolutionary Optimization. CEC 2021: 1664-1671 - [i2]Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh:
A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization. CoRR abs/2102.09954 (2021) - 2020
- [c1]Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Binh Long, Ngo Viet Hoang, Pham Dinh Thanh:
Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint. CEC 2020: 1-8
2010 – 2019
- 2019
- [j1]Huynh Thi Thanh Binh, Pham Dinh Thanh, Ta Bao Thang:
New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm. Knowl. Based Syst. 180: 12-25 (2019) - [i1]Huynh Thi Thanh Binh, Pham Dinh Thanh, Ta Bao Thang:
New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm. CoRR abs/1908.07060 (2019)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 02:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
