default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHoang Huu Viet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Vo Duc Quang
, Hoang Huu Viet, Vu Hoang Long, Tran Dinh Khang:
An Improved AdaBoost Algorithm for Highly Imbalanced Datasets in the Co-Authorship Recommendation Problem. IEEE Access 11: 89107-89123 (2023)- [c13]Vo Duc Quang, Hoang Huu Viet, Nguyen Hai Yen, Tran Dinh Khang:
An Improved Fuzzy Support Vector Machine Algorithm for Highly Imbalanced Datasets in the Co-Authorship Recommendation Problem. ACOMPA 2023: 46-53 - [c12]Son Thanh Cao, Le Van Thanh, Hoang Huu Viet:
Finding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem via Heuristic Search. AI (1) 2023: 442-454 - 2022
- [j11]Dinh Cong Le, Hoang Huu Viet:
Filtered-x Set Membership Algorithm With Time-Varying Error Bound for Nonlinear Active Noise Control. IEEE Access 10: 90079-90091 (2022) - [c11]Hoang Huu Viet, Nguyen Thi Uyen, Son Thanh Cao, TaeChoong Chung:
A Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete Lists. AI 2022: 494-506 - [c10]Nguyen Thi Uyen, Giang L. Nguyen, Canh V. Pham, Tran Xuan Sang, Hoang Huu Viet:
A Heuristic Algorithm for Student-Project Allocation Problem. CSoNet 2022: 280-291 - [c9]Son Thanh Cao, Le Quoc Anh, Hoang Huu Viet:
A Heuristic Repair Algorithm for the Hospitals/Residents Problem with Ties. ICAISC (1) 2022: 340-352 - 2021
- [j10]Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang:
A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists. J. Heuristics 27(3): 439-458 (2021) - 2020
- [j9]Viet-Hung Dang, Hoang Huu Viet, Nguyen Duc Thang, Ngo Anh Vien, Le Anh Tuan:
Improving Path Planning Methods in 2D Grid Maps. J. Comput. 15(1): 1-9 (2020) - [j8]Hoang Huu Viet, Le Hong Trang, Le Pham Tuyen, TaeChoong Chung:
A shortlist-based bidirectional local search for the stable marriage problem. J. Exp. Theor. Artif. Intell. 32(1): 147-163 (2020) - [c8]Hoang Huu Viet, Le Van Tan, Son Thanh Cao:
Finding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over Projects. FDSE (CCIS Volume) 2020: 411-422 - [c7]Nguyen Thi Uyen, Long Giang Nguyen, Truong-Thang Nguyen, Hoang Huu Viet:
A min-conflicts algorithm for maximum stable matchings of the hospitals/residents problem with ties. RIVF 2020: 1-6
2010 – 2019
- 2019
- [c6]Le Hong Trang, Nguyen Thuy Hoa, Tran Van Hoai, Hoang Huu Viet:
Finding MAX-SMTI for Stable Marriage with Ties and Bounded Preference Lists. ACOMP 2019: 107-111 - [c5]Le Hong Trang, Hoang Huu Viet, Tran Van Hoai, Tran Xuan Hao:
A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings. IMCOM 2019: 1100-1111 - [c4]Hoang Huu Viet, Nguyen Thi Uyen, Pham Tra My, Son Thanh Cao, Le Hong Trang:
A Max-Min Conflict Algorithm for the Stable Marriage Problem. PKAW 2019: 44-53 - 2017
- [j7]Seung Yoon Choi, SeungGwan Lee, Hoang Huu Viet, TaeChoong Chung:
B-Theta*: an Efficient Online Coverage Algorithm for Autonomous Cleaning Robots. J. Intell. Robotic Syst. 87(2): 265-290 (2017) - 2016
- [c3]Hoang Huu Viet, Le Hong Trang, SeungGwan Lee, TaeChoong Chung:
A Bidirectional Local Search for the Stable Marriage Problem. ACOMP 2016: 18-24 - [c2]Le Hong Trang, Hoang Huu Viet, TaeChoong Chung:
Finding "optimal" stable marriages with ties via local search. KSE 2016: 61-66 - [c1]Hoang Huu Viet, Le Hong Trang, SeungGwan Lee, TaeChoong Chung:
An Empirical Local Search for the Stable Marriage Problem. PRICAI 2016: 556-564 - 2015
- [j6]Hoang Huu Viet, Viet-Hung Dang, Seung Yoon Choi, TaeChoong Chung:
BoB: an online coverage approach for multi-robot systems. Appl. Intell. 42(2): 157-173 (2015) - [j5]Viet-Hung Dang, Nguyen Duc Thang, Hoang Huu Viet, Le Anh Tuan:
Batch-Theta* for path planning to the best goal in a goal set. Adv. Robotics 29(23): 1537-1550 (2015) - [j4]Md Nasir Uddin Laskar, Hoang Huu Viet, Seung Yoon Choi, Ishtiaq Ahmed, Sungyoung Lee, TaeChoong Chung:
Offsetting obstacles of any shape for robot motion planning. Robotica 33(4): 865-883 (2015) - 2013
- [j3]Hoang Huu Viet, Viet-Hung Dang, Md Nasir Uddin Laskar, TaeChoong Chung:
BA*: an online complete coverage algorithm for cleaning robots. Appl. Intell. 39(2): 217-235 (2013) - [j2]Hoang Huu Viet, Sang Hyeok An, TaeChoong Chung:
Dyna-Q-based vector direction for path planning problem of autonomous mobile robots in unknown environments. Adv. Robotics 27(3): 159-173 (2013) - 2012
- [j1]Hoang Huu Viet, Sang Hyeok An, TaeChoong Chung:
Univector Field Method based Multi-Agent Navigation for Pursuit Problem. Int. J. Fuzzy Log. Intell. Syst. 12(1): 86-93 (2012)
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 2025-01-09 13:28 CET 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:
