نتایج جستجو برای: random explicit

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

Journal: :IJAEIS 2011
Guillaume Martin Roger Martin-Clouaire Jean-Pierre Rellier Michel Duru

Fulfilling the production objectives of a grassland-based beef system requires a robust management strategy to secure the best practicable use of forage resources with regard to the cattle demand. To address the challenging issue of designing such strategies, this article describes the application of an ontology of agricultural production systems to the generic conceptual model SEDIVER, which s...

2007
CHRISTIANE TAKACS

We consider a random walk on Z in a stationary and ergodic random environment, whose states are called types of the vertices of Z. We nd conditions for which the speed of the random walk is positive. In the case of a Markov chain environment with nitely many states, we give an explicit formula for the speed and for the asymptotic proportion of time spent at vertices of a certain type. Using the...

2009
ALEXANDER GNEDIN

The boundary problem is considered for inhomogeneous increasing random walks on the square lattice Z2+ with weighted edges. Explicit solutions are given for some instances related to the classical and generalized number triangles.

2008
Kaushik Basu Sanghamitra Das Bhaskar Dutta

Some studies on child labor have shown that, at the level of the household, greater land wealth leads to higher child labor, thereby casting doubt on the hypothesis that child labor is caused by poverty. This paper argues that the missing ingredient may be an explicit modeling of the labor market. We develop a simple model which suggests the possibility of an inverted-U relationship between lan...

Journal: :CoRR 2008
Wojciech Sarnowski Krzysztof Szajowski

A Markov process is registered. At random moment θ the distribution of observed sequence changes. Using probability maximizing approach the optimal stopping rule for detecting the change is identified. Some explicit solution is obtained.

2005
Asaf Nachmias

We give a short proof that the largest component of the random graph G(n, 1/n) is of size approximately n. The proof gives explicit bounds for the probability that the ratio is very large or very small.

Journal: :J. Sci. Comput. 2017
Sandra May Marsha J. Berger

Journal: :J. Applied Mathematics 2012
Muhammad Aslam Noor Saira Zainab Yonghong Yao

We use the auxiliary principle technique to suggest and analyze an implicit method for solving the equilibrium problems on Hadamard manifolds. The convergence of this new implicit method requires only the speudomonotonicity, which is a weaker condition than monotonicity. Some special cases are also considered.

2012
Alexander Pacholik Matthias Riebisch

For architectural design decisions, a high number of goals and constraints has to be considered. For a proper management of their complexity and as a precondition for tool support, they have to be modeled explicitly. Existing approaches fail to provide a predictable, rigor decision-making as well as a to deal with incomplete or even partly contradicting information. This paper presents an appro...

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

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