Results 221 to 230 of about 324,021 (282)

EdgeGuard-AI: Zero-Trust and Load-Aware Federated Scheduling for Secure and Low-Latency IoT Edge Networks. [PDF]

Sensors (Basel)
Alanazi AG, Alanazi HA.
europepmc   +1 more source

A Physiological Microfluidic Blood–Brain‐Barrier Model for In Vitro Study of Nanoparticle Trafficking and Accumulation

Advanced Healthcare Materials, EarlyView.
A human microfluidic blood‐brain barrier (mBBB) model enables spatially resolved comparison of nanoparticle trafficking. Extracellular vesicles (EVs), liposomes, and nanoplastics exhibit distinct transport and disruption behaviors, revealing that membrane composition and uptake pathways govern BBB interaction.
Bryan B. Nguyen, Neona M. Lowe, Sophia Kellogg, Kuan‐Wei Huang, Hannah O'Toole, Elizabeth J. Hale, Venktesh S. Shirure, Bhupinder S. Shergill, Steven C. George, Randy P. Carney   +9 more
wiley   +1 more source

IntelliScheduler: an edge-cloud computing environment hybrid deep learning framework for task scheduling based on learning. [PDF]

Sci Rep
Raju LR, Reddy MVK, Surukanti SR, Sudhakar G, Subrahmanya Sarma M VV, Adepu A.   +5 more
europepmc   +1 more source

Edge computing task scheduling mechanism based on multi-dimensional feature extraction and attention fusion. [PDF]

PLoS One
Zhang S, Li JY, Yu P.
europepmc   +1 more source

Optimizing sleep scheduling in wireless sensor networks via node utility and critical target prioritization. [PDF]

Sci Rep
Wu J, Tian S, Qi X, Cai Z, Wang P.
europepmc   +1 more source

Research on online EDI order scheduling optimization strategy in manufacturing enterprises based on time-varying Markov chains. [PDF]

Sci Rep
Wulan Q.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Parallel Scheduling Algorithms

Operations Research, 1983
Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.
Dekel, Eliezer, Sahni, Sartaj
openaire   +1 more source

On Manpower Scheduling Algorithms

SIAM Review, 1982
This paper provides a systematic review of several of the available manpower scheduling algorithms from a common framework. The five-stage framework is based on the recognition that the general scheduling problem can be decomposed into five separate but related subproblems or stages, namely, the determination of temporal manpower requirements, total ...
Tien, James M., Kamiyama, Angelica
openaire   +2 more sources