The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 121 –
140 of
721
Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification of the...
We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters,
arXiv:0909.4136]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch et al. [SIAM J. Comput. 37 (2007) 977–1013].
We add sequential operations to the categorical algebra of weighted and
Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters,
arXiv:0909.4136]. The extra
expressiveness of
the algebra permits the description of hierarchical systems, and ones with
evolving geometry. We make a comparison with the probabilistic automata of
Lynch et al. [SIAM J. Comput.37 (2007) 977–1013].
A competition-diffusion system, where populations of healthy and malignant cells compete and move on a neutral matrix, is analyzed. A coupled system of degenerate nonlinear parabolic equations is derived through a scaling procedure from the microscopic, Markovian dynamics. The healthy cells move much slower than the malignant ones, such that no diffusion for their density survives in the limit. The malignant cells may locally accumulate, while for the healthy ones an exclusion rule is considered....
We study a branching random walk on with an absorbing barrier. The position of the barrier depends on the generation. In each generation, only the individuals born below the barrier survive and reproduce. Given a reproduction law, Biggins et al. [Ann. Appl. Probab.1(1991) 573–581] determined whether a linear barrier allows the process to survive. In this paper, we refine their result: in the boundary case in which the speed of the barrier matches the speed of the minimal position of a particle...
Currently displaying 121 –
140 of
721