نتایج جستجو برای: increasing non
تعداد نتایج: 1745931 فیلتر نتایج به سال:
this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...
this research has been taken among the students of high school in karaj city during the years 1391 and 1392. this is a survey research and data gathering is through questionnaires. studying the “an analysis of students’ tendency toward non-native reference groups in karaj”. the questionnaire was distributed among 260 of these students who were chosen through multi step cluster sampling. conside...
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we show that the 2n-th moment of the trace of a random k-dimensional unitary matrix is equal to the number of permutations of length n with no increasing subsequence of length greater than k. We then generalize this to ot...
Let 〈a1, a2, . . . , an〉 be a sequence of comparable elements. In this paper, we study two constrained versions of the longest increasing subsequence (LIS) problem. The first problem is the range-constrained longest increasing subsequence (RLIS) problem. Given 0 < LI ≤ UI < n and 0 ≤ LV ≤ UV , the objective of the RLIS problem is to deliver a maximum-length increasing subsequence 〈ai1 , ai2 , ....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید