Results 271 to 280 of about 3,942,699 (304)
Some of the next articles are maybe not open access.
Software: Practice and Experience, 1981
AbstractThis paper argues that programs are better regarded as dynamic running objects rather than as static textual ones. The concept of dynamic building, whereby a program is constructed as it runs, is described. It also describes the Builder system, which is an implementation of dynamic building for an interactive algebraic programming language ...
openaire +2 more sources
AbstractThis paper argues that programs are better regarded as dynamic running objects rather than as static textual ones. The concept of dynamic building, whereby a program is constructed as it runs, is described. It also describes the Builder system, which is an implementation of dynamic building for an interactive algebraic programming language ...
openaire +2 more sources
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 +2 more sources
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 +2 more sources
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
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
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
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
Accelerating dynamic programming.
2009Dynamic Programming (DP) is a fundamental problem-solving technique that has been widely used for solving a broad range of search and optimization problems. While DP can be invoked when more specialized methods fail, this generality often incurs a cost in efficiency.
openaire +1 more source
Dynamic Choice Theory and Dynamic Programming
Econometrica, 1979Kreps, David M, Porteus, Evan L
openaire +1 more source
SDDP.jl : A Julia Package for Stochastic Dual Dynamic Programming
INFORMS Journal on Computing, 2021Lea Kapelevich, Oscar Dowson
exaly
Using Dynamic Programming for Solving Variational Problems in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1990A A Amini, R C Jain
exaly