Search Results for author:
Found 2 papers, 0 papers with code
Competitive Facility Location under Random Utilities and Routing Constraints
To tackle this problem, we explore three types of valid cuts, namely, outer-approximation and submodular cuts to handle the nonlinear objective function, as well as sub-tour elimination cuts to address the complex routing constraints.
Optimal Privacy Preserving for Federated Learning in Mobile Edge Computing
This theoretical bound is decomposed into two components, including the variance of the global gradient and the quadratic bias that can be minimized by optimizing the communication resources, and quantization/noise parameters.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
