نتایج جستجو برای: line completion number

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

2017
Shujuan Zhou Linglong Xu Yongyong Ma Liyuan Tang Yu Zhang Yifen Shi Lan Sun Yi Chen Bin Liang Yuhong Zhou Kang Yu Jianping Shen

We retrospectively analyzed LMR at diagnosis and at completion of first-line therapy and prognosis in173 patients with DLBCL from 2005 to 2016. We found that patients with an LMR < 3.2 at diagnosis, as well as at completion of first-line therapy, had significantly lower PFS and OS rates than those with an LMR ≥ 3.2 (P<0.05). Patients with LMR that recovered from the low level at diagnosis showe...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه کاشان 1388

textbooks play a crucial role in language learning classrooms. the problem is that among the great quantity of available textbooks on the market which one is appropriate for a specific classroom and a group of learners. in order to evaluate elt textbooks, theorists and writers have offered different kinds of evaluative frameworks based on a number of principles and criteria. this study evaluate...

Journal: :J. Algorithms 1997
Houman Alborzi Eric Torng Patchrawat Uthaisombut Stephen Wagner

Virtually all previous research in on-line algorithms has focused on single-threaded systems where only a single sequence of requests compete for system resources. To model multi-threaded on-line systems, we define and analyze the k-client problem, a dual of the well-studied k-server problem. In the basic k-client problem, there is a single server and k clients, each of which generates a sequen...

Journal: :Developmental Science 2019

Journal: :Attention, Perception, & Psychophysics 2019

Journal: :European Journal of Psychology of Education 2015

Journal: :Missouri Journal of Mathematical Sciences 2013

Journal: :Mathematische Zeitschrift 2022

In his Ph.D. thesis, Cadegan-Schlieper constructs an invariant of the embedded topology a line arrangement which generalizes $$\mathcal {I}$$ -invariant introduced by Artal, Florens and author. This new is called loop-linking number in present paper. We refine result proving that homeomorphism type complement. give two effective methods to compute this invariant, both are based on braid monodro...

Journal: :Oper. Res. Lett. 2004
Nicole Megow Andreas S. Schulz

We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. c © 2003 Elsevier B.V. All righ...

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

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