134 search results - page 15 / 27 » Speeding Up Dynamic Shortest-Path Algorithms |
129
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
128
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 4 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...
170
click to vote
ISPASS
2008
IEEE
15 years 9 months ago
2008
IEEE
The evolution of microprocessors has been hindered by their increasing power consumption and the heat generation speed on-die. High temperature impairs the processor’s reliabili...
131
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
147
click to vote
DCOSS
2011
Springer
14 years 2 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...