Abstract: Dynamic nonlinear least square (DNLS) problems are usually encountered in modern engineering, which are challenging to solve due to time-delay errors and noise in practical applications with ...
Abstract: Minimizing the decoding delay, the completion time, or the delivery time of instantly decodable network coding (IDNC) can all be approximated to a maximum weight clique (MWC) problem, which ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback