Results 221 to 230 of about 437,526 (285)
Internet of Vehicles (IoV)-Based Task Scheduling Approach Using Fuzzy Logic Technique in Fog Computing Enables Vehicular Ad Hoc Network (VANET). [PDF]
Sensors (Basel)Ehtisham M +7 more
europepmc +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Emerging evidence suggests that low‐frequency neural oscillations are dynamically regulated by consciousness levels, with the recovery of low cortical activity potentially serving as a neurophysiological substrate for conscious emergence. Targeted enhancement of these low‐frequency rhythms in patients with disorders of consciousness
Chuan Xu +10 more
wiley +1 more source
A Systematic Review and Meta‐Analysis of the Recurrence of Autoimmune Encephalitis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Autoimmune encephalitis (AE) is a disease with a potential for recurrence, and patients receive immunotherapy to prevent it. However, there is no consensus on the duration of immunotherapy. This study aimed to determine the recurrence rate and identify the risk factors for AE to provide guidance on the duration of immunotherapy ...
Shangkai Bai +5 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
INFORMS Journal on Computing, 1996
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of processors, assuming that the tasks have to be executed strictly periodically. We show that the problem is NP-complete in the strong sense, even in the case of a single processor, but that it is solvable in polynomial time if the periods and execution times are
Korst, J.H.M. +2 more
openaire +2 more sources
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of processors, assuming that the tasks have to be executed strictly periodically. We show that the problem is NP-complete in the strong sense, even in the case of a single processor, but that it is solvable in polynomial time if the periods and execution times are
Korst, J.H.M. +2 more
openaire +2 more sources
Scheduling independent multiprocessor tasks
Algorithmica, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amoura, A. K. +3 more
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1997
Summary: Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous.
Phillips, Cynthia +2 more
openaire +2 more sources
Summary: Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous.
Phillips, Cynthia +2 more
openaire +2 more sources
Multifunction Radar: Task Scheduling
Journal of Mathematical Modelling and Algorithms, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Duron, Cyril, Proth, Jean-Marie
openaire +2 more sources
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers, 1986The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its
Błażewicz, Jacek +2 more
openaire +2 more sources
2011
In many real-time control applications, periodic activities represent the major computational demand in the system. Periodic tasks typically arise from sensory data acquisition, low-level servoing, control loops, action planning, and system monitoring.
openaire +1 more source
In many real-time control applications, periodic activities represent the major computational demand in the system. Periodic tasks typically arise from sensory data acquisition, low-level servoing, control loops, action planning, and system monitoring.
openaire +1 more source
Journal of Computer Science and Technology, 1997
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplify programming.
Jiubin Ju, Yong Wang, Yu Yin
openaire +1 more source
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplify programming.
Jiubin Ju, Yong Wang, Yu Yin
openaire +1 more source