Results 281 to 290 of about 700,908 (311)
Some of the next articles are maybe not open access.
IEEE Transactions on Visualization and Computer Graphics, 2010
Stochastic transparency provides a unified approach to order-independent transparency, antialiasing, and deep shadow maps. It augments screen-door transparency using a random sub-pixel stipple pattern, where each fragment of transparent geometry covers a random subset of pixel samples of size proportional to alpha. This results in correct alpha-blended
Eric Enderton +3 more
openaire +2 more sources
Stochastic transparency provides a unified approach to order-independent transparency, antialiasing, and deep shadow maps. It augments screen-door transparency using a random sub-pixel stipple pattern, where each fragment of transparent geometry covers a random subset of pixel samples of size proportional to alpha. This results in correct alpha-blended
Eric Enderton +3 more
openaire +2 more sources
“Stochastic” and “non-stochastic”
The British Journal of Radiology, 1982Hulse and Mole (1982) have proposed that the terms stochastic and non-stochastic be replaced by words reflecting the currently understood mechanisms underlying the effects they describe: for example, “haplocytic” to replace stochastic for effects which are attributed to changes induced in a single cell, i.e. genetic effects and cancer induction.
E. V. Hulse, R. H. Mole
openaire +2 more sources
Fundamenta Informaticae, 2017
We consider stochastic systems of equations of tree series, i.e., systems of equations whose right-hand sides are stochastic tree polynomials. We obtain their least solutions in arbitrary substochastic algebras, using both the [IO]- and OI-substitution mode.
Symeon Bozapalidis, George Rahonis
openaire +2 more sources
We consider stochastic systems of equations of tree series, i.e., systems of equations whose right-hand sides are stochastic tree polynomials. We obtain their least solutions in arbitrary substochastic algebras, using both the [IO]- and OI-substitution mode.
Symeon Bozapalidis, George Rahonis
openaire +2 more sources
Stochastics and stochastics reports
Stochastics and Stochastic Reports, 1990(1990). Stochastics and stochastics reports. Stochastics and Stochastic Reports: Vol. 33, No. 1-2, pp. ebi-ebii.
Mark H. A. Davis, Steven E. Shreve
openaire +1 more source
Proceedings of the National Academy of Sciences, 1953
Es wird eine weitgehende Verallgemeinerung des (2-Personen-0-Summen-)Matrixspieles behandelt. \(N\) Positionen \(1,\dots ,N\) durchlaufen zwei Spieler \(A,B\) in der folgenden Weise: In der Position \(k\) wählen \(A\) und \(B\) unabhängig voneinander je eine natürliche Zahl \(i\) bzw. \(j\), \(1\leq i\leq m_k, 1\leq j\leq n_k\).
openaire +3 more sources
Es wird eine weitgehende Verallgemeinerung des (2-Personen-0-Summen-)Matrixspieles behandelt. \(N\) Positionen \(1,\dots ,N\) durchlaufen zwei Spieler \(A,B\) in der folgenden Weise: In der Position \(k\) wählen \(A\) und \(B\) unabhängig voneinander je eine natürliche Zahl \(i\) bzw. \(j\), \(1\leq i\leq m_k, 1\leq j\leq n_k\).
openaire +3 more sources
CORES OF STOCHASTIC COOPERATIVE GAMES WITH STOCHASTIC ORDERS
International Game Theory Review, 2002In this paper we analyze cooperative games where the worth of a coalition is uncertain and the players only know their probability distribution. The novelty of our analysis is that the comparison among the uncertain values is done by stochastic orders among random variables.
Francisco R. Fernández +2 more
openaire +2 more sources
Combining the Stochastic Counterpart and Stochastic Approximation Methods
Discrete Event Dynamic Systems, 1997Let \(\ell(v, \theta)=E_v\{L(Y,\theta)\}\) be the expected performance of a discrete event system (DES), where \(L\) is the sample performance driven by an input vector \(Y\) with a probability density function \(f(y, v)\) and \(\theta\) is a parameter of the sample performance.
Jean-Pierre Dussault +3 more
openaire +2 more sources
Stochastic Bounds For Some Stochastic Optimisation Problems
Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools, 2020We consider the path length optimisation for an acyclic graph model with discrete random delays attributed to the edges. This problem has been largely studied in the literature and the application of the stochastic ordering is not new. We aim here to give a comprehensible presentation of some kinds of bounds with a particular attention to their ...
Fourneau, Jean-Michel +2 more
openaire +2 more sources
Stochastic and Non-Stochastic Feature Selection
2017Feature selection has been applied in several areas of science and engineering for a long time. This kind of pre-processing is almost mandatory in problems with huge amounts of features which requires a very high computational cost and also may be handicapped very frequently with more than two classes and lot of instances.
Antonio J. Tallón-Ballesteros +2 more
openaire +1 more source