نتایج جستجو برای: increasing non

تعداد نتایج: 1745931  

2017
Mitra Nasri Geoffrey Nelissen

Many real-time systems use fixed-priority scheduling (FPS) for three main reasons: (i) it is easy to understand, configure and analyse, (ii) it has low runtime overheads, and (iii) it is widely implemented in commercial operating systems. Additionally, FPS is enforced by some industrial safety related standards such as Autosar. However, FPS is not optimal from a schedulability viewpoint as it m...

Journal: :Theor. Comput. Sci. 2004
Klaus Aehlig Ulrich Berger Martin Hofmann Helmut Schwichtenberg

An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel’s and therefore defines a non-size-increasing polynomial time computable function.

2011
Verena Heidrich-Meisner Christian Igel

Racing algorithms are iterative methods for identifying the best among several options with high probability. The quality of each option is a random variable. It is estimated by its empirical mean and concentration bounds obtained from repeated sampling. In each iteration of a standard racing algorithm each promising option is reevaluated once before being statistically compared with its compet...

Journal: :Asian Pacific journal of cancer prevention : APJCP 2005
Yasmin Bhurgri Shahid Pervez Asif Bhurgri Naveen Faridi Ahmed Usman L A G Kazi Rashida Ahmed Naila Kayani Sheema H Hasan

This first population-based study of non- Hodgkin lymphoma (NHL) from any region in Pakistan, provides an overview of the incidence pattern and time trends in Karachi and generates hypotheses for future experimental research. Epidemiological data for 429 incident (1(st) Jan 1995 to 31(st) Dec 2002), microscopically verified nodal and extra-nodal NHL cases, registered at the Karachi Cancer Regis...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید