The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science. Palindrome is a word which reads the same forward as it does backward. The longest common palindromic subsequence (LCPS) problem is a variant of the classic LCS problem which finds a longest common subsequence between two given strings such that the computed subsequence is also a palindrome. ...

The success of evolutionary methods on standard control learning tasks has created a need for new benchmarks. The classic pole balancing problem is no longer di cult enough to serve as a viable yardstick for measuring the learning e ciency of these systems. In this paper we present a more di cult version to the classic problem where the cart and pole can move in a plane. We demonstrate a neuroe...

The paper presents an attempt to bridge the gap between machine learning and symbolic reasoning. We build graph neural networks (GNNs) predict solution of Maximum Satisfiability (MaxSAT) problem, optimization variant SAT. Two closely related representations are adopted, we prove their theoretical equivalence. also show that GNNs can achieve attractive performance solve hard MaxSAT problems in c...

We reexamine a recently proposed non-inflationary solution to the monopole problem, based on the possibility that spontaneously broken Grand-Unified symmetries do not get restored at high temperature. We go beyond leading order by studying the self-consistent one-loop equations of the model. We find large next-to-leading corrections that reverse the lowest order results and cause symmetry resto...