1927 search results - page 107 / 386 » UMDAs for dynamic optimization problems |
119
Voted
IWANN
1997
Springer
15 years 4 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
111
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 2 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
97
Voted
AUTOMATICA
2002
15 years 18 days ago
2002
This paper addresses the computation of the required trajectory correction maneuvers (TCM) for a halo orbit space mission to compensate for the launch velocity errors introduced b...
HPCA
1999
IEEE
15 years 5 months ago
1999
IEEE
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
130
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
One of the main issues in the design of sensor networks is energy efficient communication of time-critical data. Energy wastage can be caused by failed packet transmission attempts...