نتایج جستجو برای: deterministic design
تعداد نتایج: 1001567 فیلتر نتایج به سال:
Conclusion. FFPE tissue analysis by multigene targeted PCR assays expands the opportunities for rapid identification of Mycobacterium species, allows differentiation of MTBC from NTM, and helps to detect co-infections. Using multigene targeted PCRs in combination with histopathology and IHC improve the accuracy of diagnosis, particularly in the presence of commensal and environmental pathogens....
ÐTasks in a real-time control application are usually periodic and they have deadline constraints by which each instance of a task is expected to complete its computation, even in the adverse circumstances caused by component failures. Techniques to recover from processor failures often involve a reconfiguration in which all tasks are assigned to fault-free processors. This reconfiguration may ...
در این رساله عملکرد یک موتور توربوپراپ که ملخ آن از نوع clark y 5868-r9 است در شرایط نقطه طرح (on- design) و خارج از نقطه طرح (off- design) مورد مطالعه قرار گرفته شده است. موتور توربوپراپ یکی از انواع موتور جت در تراست بالا و مصرف مخصوص سوخت پایین است که عدد ماخ پروازی آن هرگز از 8/. تجاوز نمی کند. دور موتور های توربوجت به حدی زیاداست که در صورت اتصال مستقیم به ملخ، سرعت نوک تیغه های ملخ به سرع...
A multi-class deterministic fluid model is proposed to describe and improve the performance of a customer contact center with skill-based routing. The fluid model can be regarded as an approximation for a stochastic queueing system with multiple customer classes and multiple server groups, with customer abandonment and non-exponential service-time and time-to-abandon distributions. The fluid mo...
This paper describes an effective method for teaching design in a deterministic manner that is especially effective for underrepresented students (e.g. culture, race, gender, physical disability, personality, etc.). Ten years ago we postulated that students can learn a deterministic design process not only to learn about design, but to better study math and science with peers through the use of...
We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive node weights w : V → (0,∞), the goal is to find a proper node coloring of G whose color classes C1, C2, . . . , Ck minimize k ∑ i=1 maxv∈Ci w(v). We design a general framework which allows to convert approximation algorithms for standard node coloring into algorithms fo...
in this study, the stochastic cell formation problem with developing model within queuing theory with stochastic demand, processing time and reliability has been presented. machine as server and part as customer are assumed where servers should service to customers. since, the cell formation problem is np-hard, therefore, deterministic methods need a long time to solve this model. in this study...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید