Results 71 to 80 of about 3,867,002 (189)
Random Numbers and Gaming [PDF]
, 2017 In Counter Strike: Global Offensive spray pattern control becomes a muscle memory to a player after long periods of playing. It’s a design choice that makes the gunplay between players more about instant crosshair placement with the faster player usually
Baglin, Sinjin
core +1 more source
Random time changes of Feller processes
, 2017 We show that the SDE $dX_t = (X_{t-}) \, dL_t$, $X_0 \sim $ driven by a one-dimensional symnmetric $ $-stable L vy process $(L_t)_{t \geq 0}$, $ \in (0,2]$, has a unique weak solution for any continuous function $ : \mathbb{R} \to (0,\infty)$ which grows at most linearly. Our approach relies on random time changes of Feller processes.
openaire +2 more sources
Countably many simultaneous random changes of time scales
Stochastic Processes and their Applications, 1984 In this work the author extends previous work by himself [Adv. Math. 12, 32-57 (1974; Zbl 0379.60096)] on the finite dimensional-time changes case to the countably-infinite-dimensional time changes problem. For that he constructs the relevant processes, \(\sigma\)-algebras and defines correspondingly the infinitely many components time changes. He then
openaire +2 more sources
Applied Sciences, 2016 It is difficult for autonomous underwater vehicles (AUVs) to obtain accurate aided position information in many locations because of underwater conditions.
Li-Ye Zhao +4 more
doaj +1 more source
Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs [PDF]
, 2016 Many real world operational research problems can be formulated as graph colouring problems. Algorithms for this problem usually operate under the assumption that the size and constraints of a problem are fixed, allowing us to model the problem using a static graph.
Hardy, Bradley +2 more
openaire +1 more source
Pairwise Interaction on Random Graphs [PDF]
We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction
Berninghaus, Siegfried K., Haller, Hans
core
On adaptive refinements in discrete probabilistic fracture models
Fracture and Structural Integrity, 2016 The possibility to adaptively change discretization density is a well acknowledged and used feature of many continuum models. It is employed to save computational time and increase solution accuracy.
J. Eliáš
doaj
A Random Time Change Relating Semi-Markov and Markov Processes
The Annals of Mathematical Statistics, 1968 We investigate the question of when a semi-Markov process is transformed by a random time change into a Markov process.
openaire +3 more sources
BMC ImmunologyBackground HIV has an effect on lowering CD4 cell count, which lowers the ability to resist contamination. For patients on ART in areas with limited resources, the CD4 cell count assessment is crucial for determining treatment responses and therapeutic ...
Gebru Gebremeskel Gebrerufael +1 more
doaj +1 more source
A construction of a $\beta$-coalescent via the pruning of Binary Trees
, 2012 Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $\beta(3/2,1/2)$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous's
Abraham, Romain, Delmas, Jean-François
core +1 more source