Abstract: The Multiple Longest Common Subsequence (MLCS) Problem is to find one or more longest common subsequences from multiple (≥ 3) strings. However, as the scale of the sequences increases, the ...
Abstract: This paper focuses on mobile positioning for autonomous underwater vehicle (AUV) in complex underwater environments. The positioning algorithm based on time of arrival (TOA) assumes that the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results