Results 251 to 260 of about 98,892 (314)

A Predictive and Multi-Objective Cloud–Edge Scheduling Framework with Task-Aware Encoding for Real-Time Educational Services

Yao Sun, Zhaozhen Liang, Jingxin Liu
openalex   +2 more sources

Rebuilding ability acquisition in medical imaging teaching: a multi-level AI-driven teaching paradigm based on cognitive-information theory. [PDF]

BMC Med Educ
An J, Leng X, Liu Y, Zhou J, Liang Y, Chen Y, Qiu S.   +6 more
europepmc   +1 more source

4-weekly avelumab plus axitinib in patients with metastatic renal cell carcinoma. [PDF]

BJC Rep
Vasudev NS, Aleem U, Humphries K, Pillai M, Pickwell-Smith B, Ralph C, Jagdev S, Simpson J, Dearden H, Waddell T.   +9 more
europepmc   +1 more source

Scheduling od hard real- time periodic systems with various kinds of deadline and offset constraints

, 1999
Joël Goossens, Raymond Devillers
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On a Real-Time Scheduling Problem

Operations Research, 1978
We study the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems. A periodic-time-critical task consists of an infinite number of requests, each of which has a prescribed deadline. The scheduling problem is to specify an order in which the requests of a set of tasks are to be executed and the processor to be used ...
Sudarshan K. Dhall, C. L. Liu 0001
openaire   +2 more sources

Scheduling real-time transactions

ACM SIGMOD Record, 1988
Scheduling transactions with real-time requirements presents many new problems. In this paper we discuss solutions for two of these problems: what is a reasonable method for modeling real-time constraints for database transactions? Traditional hard real-time constraints (e.g., deadlines) may be too limited.
Robert K. Abbott, Hector Garcia-Molina
openaire   +1 more source

Real time scheduling with Neurosched

Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence, 2002
Most scheduling problems are NP hard. Therefore, heuristics and approximation algorithms must be used for large problems when timing constraints have to be addressed. Obviously these methods are of interest when they provide near optimal solutions and when computational complexity can be controlled.
Jean-Michel Gallone, François Charpillet   +1 more
openaire   +1 more source

Scheduling real-time transactions [PDF]

ACM Transactions on Database Systems, 1992
This thesis has six chapters. Chapter 1 motivates the thesis by describing the characteristics of real-time database systems and the problems of scheduling transactions with deadlines. We also present a short survey of related work and discuss how this thesis has contributed to the state of the art.
Robert K. Abbott, Hector Garcia-Molina
openaire   +1 more source

A real time priority scheduler

Proceedings of the 1966 21st national conference on -, 1966
The real time priority scheduler reported herein evolved from a design effort to provide software aids for handling the interrupts that occur in hybrid computation. Since these interrupts are both internal and external (i.e., generated internal and external respectively to the digital portion of the computer), hybrid computation is representative of ...
Karl Ramsay, Jon C. Strauss
openaire   +1 more source

Real-Time Scheduling with a Budget

Algorithmica, 2003
Suppose that we are given a set of jobs, where each job has a processing time, a non-negative weight, and a set of possible time intervals in which it can be processed. In addition, each job has a processing cost. Our goal is to schedule a feasible subset of the jobs on a single machine, such that the total weight is maximized, and the cost of the ...
Joseph Naor, Hadas Shachnai, Tami Tamir
openaire   +1 more source