نتایج جستجو برای: lexicographic ordering
تعداد نتایج: 37555 فیلتر نتایج به سال:
Traditional backtracking search algorithms for solving constraint satisfaction problems select a variable and then construct a separate branch for each value in the variable’s domain: the order in which the values are assigned then has no effect on the overall search, when finding all solutions. Constraint solvers such as ILOG Solver and ECLPS instead use binary branching in constructing search...
In this paper, we introduce a notion of epistemic equivalence between hierarchies of conditional beliefs and hierarchies of lexicographic beliefs, thus extending the standard equivalence results of Halpern (2010) and Brandenburger et al. (2007) to an interactive setting, and we show that there is a Borel surjective function, mapping each conditional belief hierarchy to its epistemically equival...
Let I be the defining ideal of a smooth irreducible complete intersection space curve C with defining equations of degrees a and b. We use the partial elimination ideals introduced by Mark Green to show that the lexicographic generic initial ideal of I has Castelnuovo-Mumford regularity 1+ ab(a− 1)(b− 1)/2 with the exception of the case a = b = 2, where the regularity is 4. Note that ab(a− 1)(b...
Arrow's account (1951/1963) of the problem of social choice is based upon the assumption that the preferences of each individual in the relevant group are expressible by a single ordering. This paper lifts that assumption and develops a multidimensional generalization of Arrow's framework. I show that, like Arrow's original framework, the multidimensional generalization is affected by an imposs...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید