Results 21 to 30 of about 36,326 (261)
An Improved Least Slack First Real-time Scheduling Algorithm with High Return [PDF]
Jisuanji gongcheng, 2017 Signal task scheduling algorithm is the key to the effectiveness of the implementation of Cyber Physical System(CPS).When the system is fully loaded,the Least Slack First(LSF) algorithm,Earliest Deadline First(EDF) algorithm or Highest Value First(HVF ...
ZHANG Jing,SUN Shaojie,FAN Hongbo,XIAO Zhibin
doaj +1 more source
A Scheduling Method for Heterogeneous Signal Processing Platforms Based on Quantum Genetic Algorithm
Applied Sciences, 2023 Currently, many problems such as variable signal resources, complex execution environments, and low efficiency of scheduling algorithms are faced by heterogeneous signal processing platforms.
Yudong Li +5 more
doaj +1 more source
Approximation Algorithms for Scheduling with Reservations
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +3 more sources
Improvement of the Dynamic Priority Scheduling Algorithm Based on a Heapsort
IEEE Access, 2019 The earliest deadline first (EDF) scheduling algorithm is a typical representative of the dynamic priority scheduling algorithm. However, once the system is overloaded, the deadline miss rate increases and the scheduling performance deteriorates sharply,
Shanshan Meng, Qiang Zhu, Fei Xia
doaj +1 more source
Scheduling Algorithm for Multiple Set-point in WSAN Based on Simulated Annealing [PDF]
Jisuanji gongcheng, 2017 Focusing on the issue of multiple user set-point adjusting the status of dynamic physical process with real time controlling in the Wireless Sensor/Actuator Network(WSAN),an algorithm to solve multiple user set-point scheduling is proposed.The algorithm ...
PENG Dejun,WANG Yanjun,LI Kuan,YOU Luyao
doaj +1 more source
AN IMPROVED QUANTUM SCHEDULING ALGORITHM [PDF]
International Journal of Foundations of Computer Science, 2003 The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by ∊N. Classically, it needs Ω(∊N log 2 N) bits of communication to find the common 1. The best known quantum algorithms require about [Formula: see text] qubits of communication.
openaire +2 more sources
Heterogeneous redundancies scheduling algorithm for mimic security defense
Tongxin xuebao, 2018 The scheduling of heterogeneous redundancies is one of the key lines of mimic security defense,but the existing scheduling strategies are lack of consideration about the similarity among redundancies and the scheduling algorithms are incomprehensive.A ...
Qinrang LIU, Senjie LIN, Zeyu GU
doaj +2 more sources
Downlink hierarchical scheduling method for relay-enhanced cellular network based on TG-PF
Tongxin xuebao, 2013 Hierarchical scheduling model for relay-enhanced cellular network was designed to divide the w e process of resource scheduling in relay-enhanced cell into two parts,which are high-level scheduling accomplished by eNode B and low-level scheduling ...
Hua QU +3 more
doaj +2 more sources
Towards a Fair and Efficient Packet Scheduling Scheme in Inter-Flow Network Coding
Journal of Sensor and Actuator Networks, 2014 Network coding techniques are usually applied upon network-layer protocols to improve throughput in wireless networks. In scenarios with multiple unicast sessions, fairness is also an important factor.
Jin Wang +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neurodevelopmental and neurocognitive difficulties are prevalent among individuals with sickle cell disease and warrant prompt identification and support. This Special Report provides an executive summary of standards and recommendations for surveillance, screening, and evaluation for development and cognition across the lifespan developed by ...
Alyssa M. Schlenz +12 more
wiley +1 more source