default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSang Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Hieu Phan Trung, Loc Le Tan, Mao Nguyen, Phat Nguyen, Sang Nguyen, Minh-Triet Tran, Tho Quan:
XGA-Osteo: Towards XAI-Enabled Knee Osteoarthritis Diagnosis with Adversarial Learning. IJCAI 2024: 8771-8775- 2023
- [j11]Nghia Nguyen, Long Luu, Phuong Vo, Sang Nguyen, Cuong T. Do, Ngoc-Thanh Nguyen:
Reinforcement learning - based adaptation and scheduling methods for multi-source DASH. Comput. Sci. Inf. Syst. 20(1): 157-173 (2023) - 2022
- [d1]Sang Nguyen
:
multi-carpark occupancy. IEEE DataPort, 2022
- 2021
- [j10]Sang Nguyen, Zoran Salcic, Xuyun Zhang, Akshat Bisht:
A Low-Cost Two-Tier Fog Computing Testbed for Streaming IoT-Based Applications. IEEE Internet Things J. 8(8): 6928-6939 (2021) - [c2]Sang Nguyen, Zoran Salcic, Utsav Trivedi, Xuyun Zhang:
Predicting Parking Occupancy by FPGA-Accelerated DNN Models at Fog Layer. SMARTCOMP 2021: 83-88
2010 – 2019
- 2018
- [c1]Sang Nguyen, Zoran Salcic, Xuyun Zhang:
Big Data Processing in Fog - Smart Parking Case Study. ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018: 127-134
2000 – 2009
- 2005
- [j9]Guido Gentile, Sang Nguyen, Stefano Pallottino:
Route Choice on Transit Networks with Online Information at Stops. Transp. Sci. 39(3): 289-297 (2005) - 2004
- [j8]Patrice Marcotte, Sang Nguyen, Alexandre Schoeb:
A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks. Oper. Res. 52(2): 191-212 (2004) - [j7]Younes Hamdouch, Patrice Marcotte, Sang Nguyen:
Capacitated transit assignment with loading priorities. Math. Program. 101(1): 205-230 (2004) - 2001
- [j6]Sang Nguyen, Stefano Pallottino, Federico Malucelli:
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables. Transp. Sci. 35(3): 238-249 (2001) - [j5]Belgacem Bouzaïene-Ayari, Michel Gendreau, Sang Nguyen:
Modeling Bus Stops in Transit Networks: A Survey and New Formulations. Transp. Sci. 35(3): 304-321 (2001)
1990 – 1999
- 1998
- [j4]Sang Nguyen, Stefano Pallottino, Michel Gendreau:
Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks. Transp. Sci. 32(1): 54-64 (1998) - 1991
- [j3]Jean-François Mondou, Teodor Gabriel Crainic, Sang Nguyen:
Shortest path algorithms: A computational study with the C programming language. Comput. Oper. Res. 18(8): 767-786 (1991)
1980 – 1989
- 1984
- [j2]Sang Nguyen, Clermont Dupuis:
An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs. Transp. Sci. 18(2): 185-202 (1984) - 1981
- [j1]Michael Florian, Sang Nguyen, Stefano Pallottino:
A dual simplex algorithm for finding all shortest paths. Networks 11(4): 367-378 (1981)
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-21 21:29 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:
