نتایج جستجو برای: lévêque problem
تعداد نتایج: 880269 فیلتر نتایج به سال:
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
abstract the current study examined the role of emotional intelligence and motivation on language learning of efl learners in iranian context. the participants of this study were 162 female and 100 male junior high school students. these participants were selected by convenient sampling method. to carry out the study two questionnaires were administered to the participants. first, the adap...
the main purpose of the present study was to investigate the relationship between listening proficiency and metacognitive listening strategies awareness among low, mid, and highly self-regulated students. three hundred and seventy one efl students participated in this study (all grade 3 and 4 high-school students who were studying in khansar in academic year 1391-92). to gather the data, three ...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
An asteroidal triple in a graph G is a set of three nonadjacent vertices such that for any two of them there exists a path between them that does not intersect the neighborhood of the third. Special asteroidal triple in a graph G is an asteroidal triple such that each pair is linked by a special connection. A special asteroidal triples play a central role in a characterization of directed path ...
An asteroidal triple is a set of three independent vertices in a graph such that any two vertices in the set are connected by a path which avoids the neighbourhood of the third. A classical result by Lekkerkerker and Boland [10] showed that interval graphs are precisely the chordal graphs that do not have asteroidal triples. Interval graphs are chordal, as are the directed path graphs and the p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید