all AI news
Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
March 27, 2024, 4:42 a.m. | Rahul Vaze, Jayakrishnan Nair
cs.LG updates on arXiv.org arxiv.org
Abstract: An online non-convex optimization problem is considered where the goal is to minimize the flow time (total delay) of a set of jobs by modulating the number of active servers, but with a switching cost associated with changing the number of active servers over time. Each job can be processed by at most one fixed speed server at any time. Compared to the usual online convex optimization (OCO) problem with switching cost, the objective function …
abstract arxiv capacity cost cs.ds cs.lg delay flow jobs memory optimization servers set total type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Senior Data Scientist
@ ITE Management | New York City, United States