Abstract: Graph-structured combinatorial problems in complex networks are prevalent in many domains, and are computationally demanding due to their complexity and non-linear nature. Traditional ...

Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...

Abstract: Aiming at the existing deep learning radar signal modulation recognition methods are mostly based on time-frequency image (TFI) and consequently result in networks with a large number of ...