Results 251 to 260 of about 79,637 (307)

Achieving Ultra-Reliable Low Latency Communication in 5G and Beyond. [PDF]

Sensors (Basel)
Bajracharya R, Shrestha R.
europepmc   +1 more source

A hybrid RL-GA-LSTM-AE framework for energy-aware and SLA-driven task scheduling in cloud computing environments. [PDF]

Sci Rep
Narsimhulu B, Kumar TS.
europepmc   +1 more source

Intelligent Patient Appointment Schedules. [PDF]

Healthcare (Basel)
Elhag S, Althagafi L, Almouabdi S.
europepmc   +1 more source

Optimization of train real-time dynamic scheduling under unexpected events in high-speed railway based on MAPPO. [PDF]

Sci Rep
Tang Z, Huang P, Sun J.
europepmc   +1 more source

Construction and prototype effect evaluation of a multi-agent collaborative system for operating room nursing. [PDF]

Front Digit Health
Li Y, Zou J, Wang L, Zhao R, Yuan J.
europepmc   +1 more source

Tackling Administrative Burden in Graduate Medical Education: Consider AI-Powered Tools. [PDF]

J Grad Med Educ
Phung JY, Chung AD, Kwan BY.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Resource-Constrained Assignment Scheduling

Operations Research, 1986
Many resource-constrained assignment scheduling problems can be modeled as 0-1 assignment problems with side constraints (APSC). Unlike the well-known assignment problem of linear programming, APSC is NP-complete. In this paper we define a branch-and-bound algorithm for solving APSC to optimality.
Joseph B Mazzola, Alan W Neebe
exaly   +2 more sources

Greed in resource scheduling

[1989] Proceedings. Real-Time Systems Symposium, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donald W. Gillies, Jane W.-S. Liu
openaire   +1 more source

Reconfigurable resource scheduling

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006
We consider a class of scheduling problems that we refer to as reconfigurable resource scheduling. This class of problems is motivated by emerging applications that involve dynamically allocating a large number of shared resources to a variety of services. We design efficient online algorithms for certain problems in this class.
C. Greg Plaxton, Yu Sun 0012, Mitul Tiwari, Harrick M. Vin   +3 more
openaire   +1 more source