Results 251 to 260 of about 449,073 (289)
Logging disrupts the ecology of molecules in headwater streams. [PDF]
Freeman EC +4 more
europepmc +1 more source
A Framework for Budget-Constrained Zero-Day Cyber Threat Mitigation: A Knowledge-Guided Reinforcement Learning Approach. [PDF]
Basak M, Shin GY.
europepmc +1 more source
Effects of waterlogging on microbial activity, soil nutrient availability, nutrient uptake, and yield of tolerant and sensitive onion genotypes. [PDF]
Pawar AR +6 more
europepmc +1 more source
Analysis of Bonding Defects in Cementing Casing Using Attenuation Characteristic of Circumferential SH Guided Waves. [PDF]
Gao J +5 more
europepmc +1 more source
Introducing PROSPECT: a novel process for prospectively tracking research engagement. [PDF]
Craike M, Klepac B, Mowle A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Standard Log-Fréchet and Log-log-Fréchet Laws
Mathematical Methods of StatisticszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Praveena, A. S., Ravi, S.
openaire +2 more sources
Wilmott Journal, 2009
AbstractThis paper extends the pathwise adjoint method for Greeks to the displaced‐diffusion LIBOR market model and also presents a simple way to improve the speed of the method. The speed improvements of approximately 20% are achieved without using any additional approximations to those of Giles‐Glasserman.
Nick Denson, Mark S. Joshi
openaire +1 more source
AbstractThis paper extends the pathwise adjoint method for Greeks to the displaced‐diffusion LIBOR market model and also presents a simple way to improve the speed of the method. The speed improvements of approximately 20% are achieved without using any additional approximations to those of Giles‐Glasserman.
Nick Denson, Mark S. Joshi
openaire +1 more source
RUSPACE(log n ) $\subseteq$ DSPACE(log 2 n /log log n )
Theory of Computing Systems, 1998We present a deterministic algorithm running in space O(log2 n /log log n ) solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n ) time-bounded algorithm for this problem running on a parallel pointer machine.
openaire +1 more source
2011
Operating systems and applications typically come with mechanisms for reporting errors as well as security-relevant actions such as users logging on and off. These events are reported as entries in log files. The objective of logging is to make these events transparent and comprehensible.
David Basin +2 more
openaire +1 more source
Operating systems and applications typically come with mechanisms for reporting errors as well as security-relevant actions such as users logging on and off. These events are reported as entries in log files. The objective of logging is to make these events transparent and comprehensible.
David Basin +2 more
openaire +1 more source

