نتایج جستجو برای: the extended mixture rule approach
تعداد نتایج: 16241036 فیلتر نتایج به سال:
‎Here we consider a new class of skew logistic distribution as a generalized mixture of the standard logistic and skew logistic distributions‎, ‎and study some of its important aspects‎. ‎The tail behaviour of the distribution is compared with that of the skew logistic distribution and a location-scale extension of the distribution is proposed‎. ‎Fu...
This paper presents a nonlinear vibration analysis of functionally graded graphene platelet (GPL) reinforced plates on elastic foundations. Uniformly or non-uniformly distributed internal pores were present in the plates. Based modified Halpin-Tsai micromechanics model and extended rule mixture, material properties evaluated. The governing equations, coupled with effect foundations, derived by ...
A mixture approach to clustering is an important technique in cluster analysis. A mixture of multivariate multinomial distributions is usually used to analyze categorical data with latent class model. The parameter estimation is an important step for a mixture distribution. Described here are four approaches to estimating the parameters of a mixture of multivariate multinomial distributions. Th...
We investigate one-dimensional Probabilistic Cellular Automata, called Diploid Elementary Automata (DECA), obtained as random mixture of two different rules. All the cells are updated synchronously and probability for one cell to be $0$ or $1$ at time $t$ depends only on value same that its neighbors $t-1$. These very simple models show a rich behavior strongly depending choice randomly mixed t...
Explaining adaptive behavior is a central problem in artificial intelligence research. Here we formalize adaptive agents as mixture distributions over sequences of inputs and outputs (I/O). Each distribution of the mixture constitutes a ‘possible world’, but the agent does not know which of the possible worlds it is actually facing. The problem is to adapt the I/O stream in a way that is compat...
The density classification problem is the computational problem of finding the majority in a given array of votes, in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density classification problem. On the other hand, it was shown that a probabilistic mixture of the traffic rule and the majority rule solves the one-dimensional problem correct...
Allocating data fragments in distributed database systems is an important issue in distributed database (DDB) systems. In this research work, we will show how rule based policy languages can be used to represent different data fragment allocation techniques. Results indicate that, using rule based languages like prolog can significantly simplify the representation of such algorithms for any fur...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید