We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
In undergraduate teaching, Computer Architecture (CA) is one of the courses with more systematic, nsive and abstract knowledge. In current Chinese universities, how to bring up und...
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Software developers are constantly required to modify and adapt application features in response to changing requirements. The problem is that just by reading the source code, it ...