Su Hao, of UC San Diego, appears on Fudan University faculty list as professor in electronic information specialising in AI.

Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of ...

Abstract: The rapid expansion of Low Earth Orbit (LEO) satellite constellations presents new challenges for maintaining efficient inter-satellite communication under dynamic network topologies.

Abstract: In this study, a unique approach is presented to improve autonomous robots’ path planning abilities, especially in dynamic environments. We propose a Dynamic Spanning Tree Coverage (D-STC) ...

Many algorithms for point clouds require consistent orientation of normals in all points to understand where the object has inside and outside. It is not an easy task to achieve. The most famous ...

Scientists have trained an AI algorithm to count the number of flowers on fruit trees using only smartphone images. The system could predict the size of a harvest months in advance — saving farmers ...

In 1983, Gallager, Humblet, and Spira published a distributed algorithm for computing a minimum spanning tree. For several years, I regarded it as a benchmark problem for verifying concurrent ...

It is accepted wisdom in computer science that the dynamics of software systems are inherently discontinuous, and that this fact makes them fundamentally different from physical systems. More than 25 ...