Abstract: Designing algorithms to solve math word problems (MWPs) is an important research topic in natural language processing and smart education domains. The task of solving MWPs involves ...
Abstract: We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-switching ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback