Results 101 to 110 of about 4,530 (127)
A molecular dynamics study of the sputtering processes of beryllium species by hydrogenic plasma. [PDF]
Sci RepLiptak A, Lawson KD, Hasan MI.
europepmc +1 more source
WEDAP: A Python Package for Streamlined Plotting of Molecular Simulation Data. [PDF]
J Chem Inf ModelYang DT, Chong LT.
europepmc +1 more source
Rare genetic variant risks in patients with sepsis-associated acute respiratory distress syndrome
Tosco-Herrera E +28 more
europepmc +1 more source
Vector Iteration in Pointed Iterative Theories [PDF]
SIAM Journal on Computing, 1980 This paper is a sequel to a previous paper S. L. Bloom, C. C. Elgot and J. B. Wright, Solutions of the iteration equation and extensions of the scalar iteration operations, SIAM J. Comput., 9 (1980), pp. 25–45. In that paper it was proved that for each morphism ⊥: 1 → 0 in an iterative theory J there is exactly one extension of the scalar iteration ...
Stephen L. Bloom +2 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Science, 1996
Letters from: [ Paul H. Rutherford ][1] [ Charles C. Baker ][1] Thomas H. Stix et al . take issue with the present course of the International Thermonuclear Experimental Reactor (ITER) initiative (Letters, 16 Feb., p. 891). ITER is a fusion research facility based on the highly successful “tokamak” approach to plasma confinement, now being ...
openaire +5 more sources
Letters from: [ Paul H. Rutherford ][1] [ Charles C. Baker ][1] Thomas H. Stix et al . take issue with the present course of the International Thermonuclear Experimental Reactor (ITER) initiative (Letters, 16 Feb., p. 891). ITER is a fusion research facility based on the highly successful “tokamak” approach to plasma confinement, now being ...
openaire +5 more sources
2008
We survey value iteration algorithms on graphs. Such algorithms can be used for determining the existence of certain paths (model checking), the existence of certain strategies (game solving), and the probabilities of certain events (performance analysis). We classify the algorithms according to the value domain (boolean, probabilistic, or quantitative)
Chatterjee K., Henzinger T.A.
openaire +2 more sources
We survey value iteration algorithms on graphs. Such algorithms can be used for determining the existence of certain paths (model checking), the existence of certain strategies (game solving), and the probabilities of certain events (performance analysis). We classify the algorithms according to the value domain (boolean, probabilistic, or quantitative)
Chatterjee K., Henzinger T.A.
openaire +2 more sources
2018
This chapter examines the question of how to iterate through a collection of objects. The chapter examines external iteration, in which you write a loop to examine the elements, and internal iteration, in which you call a method to perform the loop for you.
openaire +2 more sources
This chapter examines the question of how to iterate through a collection of objects. The chapter examines external iteration, in which you write a loop to examine the elements, and internal iteration, in which you call a method to perform the loop for you.
openaire +2 more sources
Iterated Dependencies and Kleene Iteration
2012Categorial Dependency Grammars (CDG) is a class of simple and expressive categorial grammars defining projective and discontinuous dependency structures in a strongly compositional way. They are more expressive than CF-grammars, are polynomial time recognizable and different from the mildly context sensitive grammars.
Michael I. Dekhtyar +2 more
openaire +2 more sources
2010
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +4 more sources
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +4 more sources
Nature Chemistry, 2017
Alasdair Skelton and Brett F. Thornton examine the twisting path through the several discoveries of ytterbium, from the eighteenth century to the present.
Brett F. Thornton, Alasdair Skelton
openaire +3 more sources
Alasdair Skelton and Brett F. Thornton examine the twisting path through the several discoveries of ytterbium, from the eighteenth century to the present.
Brett F. Thornton, Alasdair Skelton
openaire +3 more sources