Abstract: The Greedy Permuting Method (GPM) is a method introduced for initial population generation in the Genetic Algorithm (GA). For a test problem with 280 cities, the generated initial population ...

Crunching hard grains together leads to their rigidification, irrespective of how the system is prepared. While certain features of the resulting jammed materials—e.g. their contact force distribution ...

Non-linear regression modeling is common in epidemiology for prediction purposes or estimating relationships between predictor and response variables. Restricted cubic spline (RCS) regression is one ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...

Abstract: Aitken gradient descent (AGD) algorithm takes some advantages over the standard gradient descent and Newton methods: 1) can achieve at least quadratic convergence in general; 2) does not ...

1 College of Mathematics and Statistics, Sichuan University of Science & Engineering, Zigong, China. 2 Sichuan Province University Key Laboratory of Bridge Non-destruction Detecting and Engineering ...

To solve the low efficiency of simple greedy algorithms, [22] in 2009 proposed a degree discount heuristics to improve influence spread, by considering the degree discount of a candidate node caused ...