نتایج جستجو برای: generalized resolution
تعداد نتایج: 445532 فیلتر نتایج به سال:
Let L be the generalized mixed product ideal induced by a monomial ideal I. In this paper we compute powers of the genearlized mixed product ideals and show that Lk have a linear resolution if and only if Ik have a linear resolution for all k. We also introduce the generalized mixed polymatroidal ideals and prove that powers and monomial localizations of a generalized mixed polymatroidal ideal...
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
In this paper, the class of polymatroidal ideals are studied. In particular, we show that any polymatroidal ideal has a regular decomposition function, so we can give its explicit resolution. We also characterize generic polymatroidal ideals. Finally, we characterize monomial ideals which all their powers are generalized Cohen-Macaulay polymatroidal ideals.
W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of resolution on algebraic domains [1]. This framework allows reasoning with knowledge which is hierarchically structured and forms a (suitable) domain, more precisely, a coherent algebraic cpo as studied in domain theory. In this paper, we give conditions under which a resolution theorem — in a form underlying resolution-based ...
Difficult discrete optimization problems are often solved using a Branch and Bound approach. Resolution search is an alternate approach proposed by Chvátal for 0-1 problems, allowing more flexibility in the search process. In this paper, we generalize the Resolution Search to any discrete problem.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید