Results 101 to 110 of about 6,813,126 (333)
Serverless computing has evolved as a prominent paradigm within cloud computing, providing on-demand resource provisioning and capabilities crucial to Science and Technology for Energy Transition (STET) applications.
Kaur Jasmine, Chana Inderveer, Bala Anju
doaj +1 more source
Differentially Private Deep Q-Learning for Pattern Privacy Preservation in MEC Offloading [PDF]
Shuying Gan +3 more
openalex +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
The lot-streaming flowshop scheduling problem with equal-size sublots (ELFSP) is a significant extension of the classic flowshop scheduling problem, focusing on optimize makespan.
Ping Wang, Renato De Leone, Hongyan Sang
doaj +1 more source
Q-Drug: a Framework to bring Drug Design into Quantum Space using Deep Learning [PDF]
Zhaoping Xiong +7 more
openalex +1 more source
Quantum Emitters in Hexagonal Boron Nitride: Principles, Engineering and Applications
Quantum emitters in hexagonal boron nitride have emerged as a promising candidate for quantum information science. This review examines the fundamentals of these quantum emitters, including their level structures, defect engineering, and their possible chemical structures.
Thi Ngoc Anh Mai +8 more
wiley +1 more source
This work addresses bi-objective hybrid flow shop scheduling problems considering consistent sublots (Bi-HFSP_CS). The objectives are to minimize the makespan and total energy consumption.
Benxue Lu +3 more
doaj +1 more source
We introduce a new convergent variant of Q-learning, called speedy Q-learning, to address the problem of slow convergence in the standard form of the Q-learning algorithm. We prove a PAC bound on the performance of SQL, which shows that for an MDP with n state-action pairs and the discount factor γ only T = O(log(n)/(ε^2 (1 - γ)^4)) steps are required ...
Azar, Mohammad Gheshlaghi +3 more
openaire +2 more sources
Q-learning with Nearest Neighbors
We consider model-free reinforcement learning for infinite-horizon discounted Markov Decision Processes (MDPs) with a continuous state space and unknown transition kernel, when only a single sample path under an arbitrary policy of the system is ...
Shah, Devavrat, Xie, Qiaomin
core

