Cache efficient Value Iteration using clustering and annealing

Cache Efficient Value Iteration

2019 IEEE Symposium on Computers and Communications (ISCC) ◽

10.1109/iscc47284.2019.8969635 ◽

2019 ◽

Cited By ~ 1

Author(s):

Anuj Jain ◽

Sartaj Sahni

Keyword(s):

Value Iteration ◽

Cache Efficient

Download Full-text

Autonomous Soaring Policy Initialization Through Value Iteration

AIAA Scitech 2021 Forum ◽

10.2514/6.2021-2012 ◽

2021 ◽

Author(s):

Benjamin J. Rothaupt ◽

Stefan Notter ◽

Walter Fichter

Keyword(s):

Value Iteration ◽

Autonomous Soaring

Download Full-text

Rescore in a Flash: Compact, Cache Efficient Hashing Data Structures for n-Gram Language Models

10.21437/interspeech.2020-1939 ◽

2020 ◽

Author(s):

Grant P. Strimel ◽

Ariya Rastrow ◽

Gautam Tiwari ◽

Adrien Piérard ◽

Jon Webb

Keyword(s):

Data Structures ◽

Language Models ◽

Cache Efficient ◽

N Gram

Download Full-text

Value Iteration Architecture Based Deep Learning for Intelligent Routing Exploiting Heterogeneous Computing Platforms

IEEE Transactions on Computers ◽

10.1109/tc.2018.2874483 ◽

2019 ◽

Vol 68 (6) ◽

pp. 939-950 ◽

Cited By ~ 14

Author(s):

Zubair Md. Fadlullah ◽

Bomin Mao ◽

Fengxiao Tang ◽

Nei Kato

Keyword(s):

Deep Learning ◽

Heterogeneous Computing ◽

Value Iteration ◽

Intelligent Routing ◽

Computing Platforms

Download Full-text

A Nearer Optimal and Faster Trained Value Iteration ADP for Discrete-Time Nonlinear Systems

IEEE Access ◽

10.1109/access.2021.3051984 ◽

2021 ◽

Vol 9 ◽

pp. 14933-14944

Author(s):

Junping Hu ◽

Gen Yang ◽

Zhicheng Hou ◽

Gong Zhang ◽

Wenlin Yang ◽

...

Keyword(s):

Nonlinear Systems ◽

Discrete Time ◽

Value Iteration

Download Full-text

Reinforcement Learning and Adaptive Optimal Control for Continuous-Time Nonlinear Systems: A Value Iteration Approach

IEEE Transactions on Neural Networks and Learning Systems ◽

10.1109/tnnls.2020.3045087 ◽

2021 ◽

pp. 1-10

Author(s):

Tao Bian ◽

Zhong-Ping Jiang

Keyword(s):

Optimal Control ◽

Reinforcement Learning ◽

Nonlinear Systems ◽

Continuous Time ◽

Value Iteration ◽

Adaptive Optimal Control ◽

A Value

Download Full-text

Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs

ACM Transactions on Algorithms ◽

10.1145/3147172 ◽

2018 ◽

Vol 14 (1) ◽

pp. 1-33 ◽

Cited By ~ 2

Author(s):

Rezaul A. Chowdhury ◽

Vijaya Ramachandran

Keyword(s):

Shortest Paths ◽

Efficient Computation ◽

Cache Efficient ◽

Cache Oblivious

Download Full-text

Cache-efficient sweeping-based interval joins for extended Allen relation predicates

The VLDB Journal ◽

10.1007/s00778-020-00650-5 ◽

2021 ◽

Author(s):

Danila Piatov ◽

Sven Helmer ◽

Anton Dignös ◽

Fabio Persia

Keyword(s):

Data Structure ◽

Experimental Evaluation ◽

State Of The Art ◽

Temporal Databases ◽

Access Method ◽

Wide Range ◽

Interval Relation ◽

Cache Efficient ◽

Join Algorithms ◽

Better Than

AbstractWe develop a family of efficient plane-sweeping interval join algorithms for evaluating a wide range of interval predicates such as Allen’s relationships and parameterized relationships. Our technique is based on a framework, components of which can be flexibly combined in different manners to support the required interval relation. In temporal databases, our algorithms can exploit a well-known and flexible access method, the Timeline Index, thus expanding the set of operations it supports even further. Additionally, employing a compact data structure, the gapless hash map, we utilize the CPU cache efficiently. In an experimental evaluation, we show that our approach is several times faster and scales better than state-of-the-art techniques, while being much better suited for real-time event processing.

Download Full-text