Abstract: With the increasing demand for high-precision navigation applications, the traditional real-time kinematic (RTK) algorithm faces the problems of low ...
Abstract: Given a multiset of n positive integers and a target sum S, the subset sum problem is to find a subset such that the sum of its elements is as close as possible to S without exceeding S. We ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results