Abstract: Understanding the maximum size of a code with a given minimum distance is a major question in computer science and discrete mathematics. The most fruitful approach for finding asymptotic ...
Abstract: The problem of time-dependent nonlinear equality-constraint programming (TDNECP) is a hot topic in various scientific and engineering fields. In this paper, the problem-solving of TDNECP is ...
Long before silicon chips, a Victorian mathematician dreamed of a machine that could run any algorithm imaginable, and in doing so, invented the concept of the computer. This is the story of how the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results