Results 301 to 310 of about 676,310 (346)
The authors critically examine the Lucas tree model (LT-model) in asset pricing theory extended to include heterogeneous agents and multiple goods. Dividend streams of the trees are specified in terms of a particular good; different trees pay out indifferent goods.
Anna Pavlova, Anna Pavlova, David Cass
openaire +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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.
Patrick Schaller +2 more
openaire +2 more sources
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.
Patrick Schaller +2 more
openaire +2 more sources
International Journal of Mathematical Education in Science and Technology, 2010
We extend the well-known identity, log det A = tr log A, for any square non-singular matrix ...
Christopher S. Withers +1 more
openaire +2 more sources
We extend the well-known identity, log det A = tr log A, for any square non-singular matrix ...
Christopher S. Withers +1 more
openaire +2 more sources
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002
This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive filter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient.
Srinath Hosur +2 more
openaire +2 more sources
This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive filter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient.
Srinath Hosur +2 more
openaire +2 more sources
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.
Eric Allender, Klaus-Jörn Lange
openaire +2 more sources
q-log-distributions: Log-concavity and log-convexity
The European Physical Journal Plus, 2018Tsallis statistics along with Tsallis distributions have been attracting considerable attention of statisticians in recent years, since applications of the q-distributions can be found in various fields. However, only until recently, in 2018, a q -logarithm transformation has been considered in order to obtain new Tsallis distributions.
openaire +2 more sources
StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) [PDF]
We present a deterministic algorithm running in space O (log2n/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.
Eric Allender, Klaus-Jörn Lange
openaire +1 more source
Log++ logging for a cloud-native world
Proceedings of the 14th ACM SIGPLAN International Symposium on Dynamic Languages, 2018Logging is a fundamental part of the software development and deployment lifecycle but logging support is often provided as an afterthought via limited library APIs or third-party modules. Given the critical nature of logging in modern cloud, mobile, and IoT development workflows, the unique needs of the APIs involved, and the opportunities for ...
openaire +3 more sources
Bayesian Estimation of log N — log S
2012The study of source populations is often conducted using the cumulative distribution of the number of sources detected at a given sensitivity. The resulting “log(N > S) − logS” distribution can be used to compare and evaluate theoretical models for source populations and their evolution.
Andreas Zezas +3 more
openaire +2 more sources

