نتایج جستجو برای: general sum

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

Journal: :iranian journal of science and technology (sciences) 2007
n. nematollahi

in a subclass of the scale-parameter exponential family, we consider the sequential pointestimation of a function of the scale parameter under the loss function given as the sum of the weightedsquared error loss and a linear cost. for a fully sequential sampling scheme, second order expansions areobtained for the expected sample size as well as for the regret of the procedure. the former resear...

Journal: :Transactions of the American Mathematical Society 1916

Journal: :Social Science Research Network 2021

We consider a general-sum N-player linear-quadratic game with stochastic dynamics over finite horizon and prove the global convergence of natural policy gradient method to Nash equilibrium. In order we require certain amount noise in system. give condition, essentially lower bound on covariance terms model parameters, guarantee convergence. illustrate our results numerical experiments show that...

Journal: :Discrete Mathematics 2013
Robert S. Coulter Todd Gutekunst

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In particular, we show that any sum set must exhibit higher-order regularity and that an abelian sum set is necessarily a reversible difference set. We next develop ...

Journal: :CoRR 2009
Dae San Kim Seung-Hwan Yang

Abstract. In this paper, we construct a binary linear code connected with the Kloosterman sum for GL(2, q). Here q is a power of two. Then we obtain a recursive formula generating the power moments 2-dimensional Kloosterman sum, equivalently that generating the even power moments of Kloosterman sum in terms of the frequencies of weights in the code. This is done via Pless power moment identity ...

1997
Miroslav Ćirić Stojan Bogdanović M. Ćirić S. Bogdanović

The subject of this paper are general properties of direct sum decompositions of automata. Using certain properties of the lattice Sub(A) of subautomata of an automaton A and its Boolean part, lattices of direct sum congruences and direct sum decompositions of A are characterized. We show that every automaton A can be represented as a direct sum of direct sum indecomposable automata, and that t...

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

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