AntColor implements a very efficient, heuristic ant-based algorithm for the (classical) Graph Coloring problem. AntColor also supports several popular generalizations, namely the Bandwidth Coloring, ...
Abstract: Unit commitment (UC) problems are typically formulated as mixed-integer programs (MIP) and solved by the branch-and-bound (B&B) scheme. The recent advances in graph neural networks (GNN) ...
Abstract: This paper develops several new dynamical designs, based on the gradient neural network (GNN), from the perspective of control theory to solve the time-varying Sylvester equation (TVSE). We ...
Multivariable equations are recommended by primary prevention guidelines to assess absolute risk of cardiovascular disease (CVD). However, current equations have several limitations. Therefore, we ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback