Results 301 to 310 of about 95,650 (334)

Analysis of non-deterministic drum scheduling

BIT, 1978
A non-deterministic drum scheduler reads a file of drum pages in unpredictable order because it selects, at each step, to read the first not previously read page after the reading heads. In this paper bounds are derived for the average latency time of such a scheduler when reading a file uniformly distributed over the drum circumference under the ...
openaire   +2 more sources

Toward the deterministic scheduling of Ada tasks

[1989] Proceedings. Real-Time Systems Symposium, 2003
Addresses the problem of scheduling a restricted form of Ada tasks so as to guarantee satisfaction of timing constraints. Specifically, the use of deterministic scheduling for periodic tasks communicating through rendezvous is studied. This extends the work of A.K. Mok (1984) scheduling deterministic rendezvous to a class of nondeterministic rendezvous
E.W. Giering, T.P. Baker
openaire   +1 more source

Complexity Classification of Deterministic Scheduling Problems

2011
Complexity theory is based on a mathematical framework developed by logicians and computer scientists. This theory was developed to study the intrinsic difficulty of algorithmic problems and has proven very useful for combinatorial optimization.
openaire   +1 more source

Scheduling in Multiclass Networks with Deterministic Service Times

Queueing Systems, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

General Purpose Procedures for Deterministic Scheduling

2008
This chapter describes a number of general purpose procedures that are useful in dealing with scheduling problems in practice and that can be implemented with relative ease in industrial scheduling systems. All the techniques described are heuristics that do not guarantee an optimal solution; they instead aim at finding reasonably good solutions in a ...
openaire   +1 more source

Deterministic Search Algorithm for Sequencing and Scheduling

2008
Many sequencing and scheduling problems are recognized as being NP-complete combinatorial problems. This class of problems often necessitates the use of near-optimal solution techniques including heuristics and meta-heuristics. The recently developed H-K general purpose heuristic has been successfully demonstrated on members of this class. This chapter
Seamus M. McGovern, Surendra M. Gupta
openaire   +1 more source

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly  

Deterministic scheduling theory

European Journal of Operational Research, 1997
openaire   +1 more source

Obesity and adverse breast cancer risk and outcome: Mechanistic insights and strategies for intervention

Ca-A Cancer Journal for Clinicians, 2017
Cynthia Morata-Tarifa, Joyce M Slingerland   +1 more
exaly  

Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma

Ca-A Cancer Journal for Clinicians, 2020
Aaron J Grossberg, William L Hwang, Anirban Maitra   +2 more
exaly