An engineer for New York Times Games has been trying to teach artificial intelligence to understand wordplay more like a human.

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 ...

I ran ColPack (DISTANCE_ONE) on some of the publicly available data sets for comparison. The results are in the following table. On all of the instances, our algorithm is as good or better than the ...