Results 231 to 240 of about 100,788 (264)
Some of the next articles are maybe not open access.

Dynamic program parallelization

ACM SIGPLAN Lisp Pointers, 1992
Static program analysis limits the performance improvements possible from compile-time parallelization. Dynamic program parallelization shifts a portion of the analysis from complie-time to run-time, thereby enabling optimizations whose static detection is overly expensive or impossible. Lambda tagging
Lorenz Huelsbergen, James R. Larus
openaire   +1 more source

The dynamic behavior of programs

Proceedings of the December 9-11, 1968, fall joint computer conference, part II on - AFIPS '68 (Fall, part II), 1968
A computer system consists of several resources for which users' programs are competing: CPU time, primary and secondary storage and Input-Output devices. More and more computer systems, which are being marketed currently, allow for resource sharing among several jobs, in order to obtain a better utilization of all available equipment, or to provide ...
openaire   +1 more source

Dynamic program slicing

Information Processing Letters, 1988
A dynamic program slice is an executable subset of the original program that produces the same computations on a subset of selected variables and inputs. It differs from the static slice [\textit{M. Weiser}, IEEE Trans. Software Eng. SE-10, 352-357 (1984; Zbl 0552.68004)] in that it is entirely defined on the basis of a computation.
Bogdan Korel, Janusz W. Laski
openaire   +2 more sources

Hybrid dynamic programming

1997
In this paper we outline the derivation of a hybrid Hamilton-Jacobi-Bellman equation for our Multiple Agent Hybrid Control Architecture (MACHA) [5, 4] and a hybrid system dynamic progamming methodology.
Wolf Kohn, Jeffrey B. Remmel
openaire   +1 more source

Dynamic program improvement

1989
We are pleading for system builders to pay attention to the experience of so many novice users, and help in the provision of a problem solving environment if it is not possible to provide automatic improvements. The difficulty of using algebra systems is not just because of bad design, but is intrinsic to them.
P. D. Pearce, John P. Fitch
openaire   +1 more source

Ordinal Dynamic Programming

Management Science, 1975
Numerically valued reward processes are found in most dynamic programming models. Mitten, however, recently formulated finite horizon sequential decision processes in which a real-valued reward need not be earned at each stage. Instead of the cardinality assumption implicit in past models, Mitten assumes that a decision maker has a preference order ...
openaire   +2 more sources

SDDP.jl: A Julia Package for Stochastic Dual Dynamic Programming

INFORMS Journal on Computing, 2021
OSCAR Dowson, Lea Kapelevich
exaly  

Dynamic Choice Theory and Dynamic Programming

Econometrica, 1979
Kreps, David M, Porteus, Evan L
openaire   +1 more source

PDP: parallel dynamic programming

IEEE/CAA Journal of Automatica Sinica, 2017
Fei-Yue Wang   +2 more
exaly  

Home - About - Disclaimer - Privacy