نتایج جستجو برای: with priority schedualing
تعداد نتایج: 9207057 فیلتر نتایج به سال:
A priority queue transforms an input permutation cr of some set of size n into an output permutation z. It is shown that the number of such pairs (a, z) is (n + 1)"1 Some related enumerative and algorithmic questions are also considered.
priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. the discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. on the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
wireless sensor networks (wsns) are one of the most interesting consequences of innovations in different areas of technology including wireless and mobile communications, networking, and sensor design. these networks are considered as a class of wireless networks which are constructed by a set of sensors. a large number of applications have been proposed for wsns. besides having numerous applic...
This paper proposes a control method for the multi-agent pickup and delivery problem (MAPD problem) by extending priority inheritance with backtracking (PIBT) to make it applicable more general environments. PIBT is an effective algorithm that introduces each agent, at timestep, agents, in descending order of priority, decide their next neighboring locations timestep through communications only...
ù ù ù Ê ù Ê Ê ù ù ë ù Ê Ñ ë Ê ù ñ Ê Ñ ò ÿ , è õ õ ë ë ý ø õ À ´ ð ´ ´ , ´ ñ è é y è ù ù ú ù Ê î ù ñ Ê ù ù Ñ Ê ù Ê Ê ù Ê ù Ê Ê ù ù ë , ø õ ë ² õ ´ ë ñ è ´ ü þ î ì # î Ê ù î ù õ ù Ê Ê â ñ Ê Ê ñ ö ì ý ï y ù õ ë õ è ù À ² î Ê ù î ù î Ö ø â ² ì é õ ø y ù õ Ê Ê î ù ñ ù Ê ñ õ î î â è ø ÿ þ À õ ´ õ À ñ ´ y ù õ õ é H # ñ î ñ ù ù î ù Ê Ê î õ ñ ù ù ñ î ù î õ ù Ê î ù ù ñ î î Ê î...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید