Idle Time Window Prediction in Cellular Networks with Deep Spatiotemporal Modeling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Budgetary Constraints and Idle Time Allocation in Common-Cycle Production with non-zero Setup Time

Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...

متن کامل

Temporal Modeling of Spatiotemporal Networks

A spatiotemporal network is a spatial network (e.g., road network) along with the corresponding time-dependent travel-time for each segment of the network. Design and analysis of policies and plans on spatiotemporal networks (e.g., for path planning with locationbased services) require realistic models that accurately represent the temporal behavior of such networks. In this paper, for the firs...

متن کامل

Counterfactual Prediction with Deep Instrumental Variables Networks

We are in the middle of a remarkable rise in the use and capability of artificial intelligence. Much of this growth has been fueled by the success of deep learning architectures: models that map from observables to outputs via multiple layers of latent representations. These deep learning algorithms are effective tools for unstructured prediction, and they can be combined in AI systems to solve...

متن کامل

Implementation of a Share Algorithm for Disk Idle Time Prediction

The Share algorithm for predicting disk idle time described by Helmbold, et al was implemented and run on the cello1 dataset. As in the original paper, the share algorithm performed slightly better than the 2-Competitive algorithm and a lot better than the 30-second Fixed Time-Out algorithm. As expected, the Share algorithm performed worse than the Optimal algorithm. It was determined that vary...

متن کامل

On the Idle Time Model in Computer Networks

An open queueing network model in light traffic has been developed. The theorem on the law of the iterated logarithm for the idle time process of customers in an open queueing network has been presented. Finally, we present an application of the theorem a idle time model from computer network practice. Key–Words: mathematical models of technical systems, reliability theory, queueing theory, ope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Journal on Selected Areas in Communications

سال: 2019

ISSN: 0733-8716,1558-0008

DOI: 10.1109/jsac.2019.2904367