default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnh Son Ta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta:
Solving Edge-Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm. MIC (1) 2024: 246-261- [c11]Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta
:
Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm. MIC (1) 2024: 268-280 - [c10]Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta:
Solving Maximum Cut Problem with Multi-objective Enhance Quantum Approximate Optimization Algorithm. ICCSA (Workshops 11) 2024: 244-252 - 2023
- [c9]Nguyen Ha Huy Phuc, Anh Son Ta, Viet Hung Nguyen:
Improve the Quantum Approximate Optimization Algorithm with Genetic Algorithm. SoICT 2023: 655-662 - [c8]Chi Thao Nguyen, Jean-Philippe Gayon, Viet Hung Nguyen, Alain Quilliot, Anh Son Ta:
Pickup and Delivery Problem with Cooperative Robots. SoICT 2023: 695-700 - 2022
- [j2]Huynh van Ngai, Ta Anh Son:
Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order o(1/k2). Comput. Optim. Appl. 83(2): 615-649 (2022) - [c7]Anh Son Ta, Ngoc Bach Pham:
Solving resource forecasting in WiFi Network by NeuralProphet. SoICT 2022: 47-51 - 2020
- [c6]Ta Anh Son, Nguyen Chi Thao:
Solving Inventory Routing Problem with Logistic Ratio via DC programming. KSE 2020: 258-262
2010 – 2019
- 2019
- [c5]Anh Son Ta, Hoai An Le Thi, Tao Pham Dinh:
Solving Efficient Target-Oriented Scheduling in Directional Sensor Networks by DCA. ICCSAMA 2019: 52-63 - 2018
- [j1]Hoai An Le Thi, Ta Anh Son, Tao Pham Dinh:
An efficient DCA based algorithm for power control in large scale wireless networks. Appl. Math. Comput. 318: 215-226 (2018) - 2015
- [c4]Ta Anh Son, Hoai An Le Thi, Trong Sy Ha:
Solving Relaxation Orienteering Problem Using DCA-CUT. MCO (1) 2015: 191-202 - 2012
- [b1]Ta Anh Son:
DC programming and DCA for solving some classes of problems in transportation and communication systemes. (Programmation DC et DCA pour la résolution de certaines classes des problèmes dans les systèmes de transport et de communication). INSA de Rouen, France, 2012 - [c3]Ta Anh Son, Pham Dinh Tao, Le Thi Hoai An, Djamel Khadraoui:
Solving Many to many multicast QoS routing problem using DCA and proximal decomposition technique. ICNC 2012: 809-814 - 2010
- [c2]Ta Anh Son, Le Thi Hoai An, Djamel Khadraoui, Pham Dinh Tao:
Solving Multicast QoS Routing Problem in the Context V2I Communication Services Using DCA. ACIS-ICIS 2010: 471-476 - [c1]Ta Anh Son, Le Thi Hoai An, Djamel Khadraoui, Pham Dinh Tao:
Solving QoS Routing Problems by DCA. ACIIDS (2) 2010: 460-470
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-10-07 21:20 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:
