Results 221 to 230 of about 143,487 (261)
Some of the next articles are maybe not open access.
Journal of Money, Credit and Banking, 1973
An optimal stabilization policy is one which brings the economy to a desired point in the "best" way. What makes optimal stabilization policy in economics so difficult is our limited knowledge of the dynamic system. We may have misspecifiled the dynamic model underlying our optimization process.
Stein, Jerome L, Infante, Ettore F
openaire +1 more source
An optimal stabilization policy is one which brings the economy to a desired point in the "best" way. What makes optimal stabilization policy in economics so difficult is our limited knowledge of the dynamic system. We may have misspecifiled the dynamic model underlying our optimization process.
Stein, Jerome L, Infante, Ettore F
openaire +1 more source
A fast path planning by path graph optimization
IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2003A fast path planning method by optimization of a path graph for both efficiency and accuracy is proposed. A conventional quadtree-based path planning approach is simple, robust, and efficient. However, it has two limitations. We propose a path graph optimization technique employing a compact mesh representation.
Joo Young Hwang +3 more
openaire +1 more source
Path Preferences and Optimal Paths in Probabilistic Networks
Transportation Science, 1985The classical shortest route problem in networks assumes deterministic link weights, and route evaluation by a utility (or cost) function that is linear over path weights. When the environment is stochastic and the “traveler’s” utility function for travel attributes is nonlinear, we define “optimal paths” that maximize the expected utility.
Amir Eiger +2 more
openaire +1 more source
Finding Many Optimal Paths Without Growing Any Optimal Path Trees
International Journal of Computational Geometry & Applications, 2007Many algorithms for applications such as pattern recognition, computer vision, and computer graphics seek to compute actual optimal paths in weighted directed graphs. The standard approach for reporting an actual optimal path is based on building a single-source optimal path tree. A technique by Chen et al.2 was given for a class of problems such that
Danny Z. Chen, Ewa Misiolek
openaire +1 more source
What is optimized in an optimal path?
Behavioral and Brain Sciences, 2013AbstractAn animal confronts numerous challenges when constructing an optimal navigational route. Spatial representations used for path optimization are likely constrained by critical environmental factors that dictate which neural systems control navigation.
Fraser T, Sparks +2 more
openaire +2 more sources
The optimal path-matching problem
Proceedings of 37th Conference on Foundations of Computer Science, 1997Let \(T_1\), \(T_2\) be two disjoint stable sets in the vertex set \(V\) of a graph \(G\) and let \(V-(T_1 \cup T_2)\) be \(R\). If \(M_1, M_2\) are matroids on \(T_1\) and on \(T_2\), respectively, with the common rank \(r\) then a basic path-matching is defined as a collection of \(r\) vertex disjoint paths, all of whose internal vertices are in \(R\)
William H. Cunningham, James F. Geelen
openaire +2 more sources
Optimal path coordination problems
2008 47th IEEE Conference on Decision and Control, 2008Optimal path coordination problems for multi-vehicle systems are formulated in the framework of hybrid systems and solved using dynamic programming techniques. In these problems, the path cost for one vehicle is a discontinuous function of the distances to other vehicles. This leads to a non-standard optimal control problem.
João Borges de Sousa +1 more
openaire +1 more source
Optimal path and directed percolation
Physical Review E, 1996An efficient transfer matrix technique is introduced to study directed optimal paths in two and three dimensions. The roughness exponent $\ensuremath{\zeta}$ is 0.6325\ifmmode\pm\else\textpm\fi{}0.0007 for the two-dimensional case and $\ensuremath{\zeta}=0.555\ifmmode\pm\else\textpm\fi{}0.008$ for the three-dimensional one, in agreement with the recent
Paolo Rios +3 more
openaire +6 more sources
IEEE Transactions on Visualization and Computer Graphics, 2020
We introduce a new method for computing optimal path maps on the GPU using OpenGL shaders. Our method explores GPU rasterization as a way to propagate optimal costs on a polygonal 2D environment, producing optimal path maps which can efficiently be queried at run-time.
Renato Farias, Marcelo Kallmann
openaire +2 more sources
We introduce a new method for computing optimal path maps on the GPU using OpenGL shaders. Our method explores GPU rasterization as a way to propagate optimal costs on a polygonal 2D environment, producing optimal path maps which can efficiently be queried at run-time.
Renato Farias, Marcelo Kallmann
openaire +2 more sources
2000
One can solve various problems concerning continuous-time optimal consumption paths with the help of the theory of optimal control. Section 10.1 studies the optimal consumption path under given labor and capital incomes (Ramsey, 1928). Two alternative assumptions are considered: (i) certain and (ii) uncertain lifespan.
openaire +1 more source
One can solve various problems concerning continuous-time optimal consumption paths with the help of the theory of optimal control. Section 10.1 studies the optimal consumption path under given labor and capital incomes (Ramsey, 1928). Two alternative assumptions are considered: (i) certain and (ii) uncertain lifespan.
openaire +1 more source