# StackSeq2Seq: Dual Encoder Seq2Seq Recurrent Networks

11 Oct 2017Alessandro BayBiswa Sengupta

A widely studied non-deterministic polynomial time (NP) hard problem lies in finding a route between the two nodes of a graph. Often meta-heuristics algorithms such as $A^{*}$ are employed on graphs with a large number of nodes... (read more)

PDF Abstract

# Code Add Remove

No code implementations yet. Submit your code now