Results 231 to 240 of about 31,249 (277)
MDP modeling for multi-stage stochastic programs. [PDF]
Math ProgramMorton DP, Dowson O, Pagnoncelli BK.
europepmc +1 more source
HIGH-DIMENSIONAL NEWEY-POWELL TEST VIA APPROXIMATE MESSAGE PASSING. [PDF]
Econ Theory (N Y)Zhou J, Zou H.
europepmc +1 more source
Why Turing's Computable Numbers Are Only Non-Constructively Closed Under Addition. [PDF]
Entropy (Basel)Edmonds J.
europepmc +1 more source
Quasi-integrability from [Formula: see text]-symmetry. [PDF]
Sci RepAbhinav K, Guha P, Mukherjee I.
europepmc +1 more source
Communications of the ACM, 1978 The recursion removal algorithm presented by Strong and Walker is amplified and applied to a relatively complex PL/I program. The aim is to demonstrate systematic recursion-removal techniques on something more complex than Knuth's “sturdy toddler” and to
H R Strong
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Software: Practice and Experience, 1977
AbstractA programming situation different from an exit on a condition, but where the effect of a GOTO statement is still necessary, is examined. A notation for expressing the desired effect and s mechanism for implementation are proposed.
Brian E. Carpenter +2 more
openaire +1 more source
AbstractA programming situation different from an exit on a condition, but where the effect of a GOTO statement is still necessary, is examined. A notation for expressing the desired effect and s mechanism for implementation are proposed.
Brian E. Carpenter +2 more
openaire +1 more source
Econometrica, 1995
Summary: Core allocations may be defined for infinite horizon capital accumulation models. If agents cannot trust each other in the sense of Gale, then agents may renege on their commitments; their decisions appear time inconsistent. A core allocation is a recursive core allocation provided no coalition can improve upon its consumption stream at any ...
Becker, Robert A, Chakrabarti, Subir K
openaire +1 more source
Summary: Core allocations may be defined for infinite horizon capital accumulation models. If agents cannot trust each other in the sense of Gale, then agents may renege on their commitments; their decisions appear time inconsistent. A core allocation is a recursive core allocation provided no coalition can improve upon its consumption stream at any ...
Becker, Robert A, Chakrabarti, Subir K
openaire +1 more source
Statistica Neerlandica, 1978
AbstractThe purpose of this paper is to give an exposition of the theory behind the Kalman filter and its application to the so‐called LQG‐problem. This problem is concerned with the stochastic optimal control of a linear system with respect to a quadratic cost in the presence Gaussian disturbances.
openaire +2 more sources
AbstractThe purpose of this paper is to give an exposition of the theory behind the Kalman filter and its application to the so‐called LQG‐problem. This problem is concerned with the stochastic optimal control of a linear system with respect to a quadratic cost in the presence Gaussian disturbances.
openaire +2 more sources
Recursion versus non-recursion in Pascal: recursion can be faster
ACM SIGPLAN Notices, 1987A timing study of two Pascal programs on three machines provides some evidence that, for modern machines and compilers, the cost of removing recursion in non-trivial situations can sometimes be greater than the cost of the recursive procedure calls.
openaire +2 more sources