Sang Nguyen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2023

Reinforcement learning - based adaptation and scheduling methods for multi-source DASHNghia Nguyen, Long Luu, Phuong Vo, Sang Nguyen, Cuong T. Do, Ngoc Thanh Nguyen 0001. comsis, 20(1):157-173, 2023. [doi]

2021

Predicting Parking Occupancy by FPGA-Accelerated DNN Models at Fog LayerSang Nguyen, Zoran Salcic, Utsav Trivedi, Xuyun Zhang. smartcomp 2021: 83-88 [doi]

A Low-Cost Two-Tier Fog Computing Testbed for Streaming IoT-Based ApplicationsSang Nguyen, Zoran Salcic, Xuyun Zhang, Akshat Bisht. iotj, 8(8):6928-6939, 2021. [doi]

2018

Big Data Processing in Fog - Smart Parking Case StudySang Nguyen, Zoran Salcic, Xuyun Zhang. ispa 2018: 127-134 [doi]

2005

Route Choice on Transit Networks with Online Information at StopsGuido Gentile, Sang Nguyen, Stefano Pallottino. transci, 39(3):289-297, 2005. [doi]

2004

Capacitated transit assignment with loading prioritiesYounes Hamdouch, Patrice Marcotte, Sang Nguyen. mp, 101(1):205-230, 2004. [doi]

A Strategic Flow Model of Traffic Assignment in Static Capacitated NetworksPatrice Marcotte, Sang Nguyen, Alexandre Schoeb. ior, 52(2):191-212, 2004. [doi]

2001

Modeling Bus Stops in Transit Networks: A Survey and New FormulationsBelgacem BouzaÃ¯ene-Ayari, Michel Gendreau, Sang Nguyen. transci, 35(3):304-321, 2001. [doi]

A Modeling Framework for Passenger Assignment on a Transport Network with TimetablesSang Nguyen, Stefano Pallottino, Federico Malucelli. transci, 35(3):238-249, 2001. [doi]

1998

Implicit Enumeration of Hyperpaths in a Logit Model for Transit NetworksSang Nguyen, Stefano Pallottino, Michel Gendreau. transci, 32(1):54-64, 1998. [doi]

1991

Shortest path algorithms: A computational study with the C programming languageJean-François Mondou, Teodor Gabriel Crainic, Sang Nguyen. cor, 18(8):767-786, 1991. [doi]

1984

An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation CostsSang Nguyen, Clermont Dupuis. transci, 18(2):185-202, 1984. [doi]

1981

A dual simplex algorithm for finding all shortest pathsM. Florian, Sang Nguyen, Stefano Pallottino. networks, 11(4):367-378, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL