In this paper we continue the systematic study of Contact graphs Paths on a Grid ( CPG ) initiated in Deniz et al. (2018). A graph is for which there exists collection pairwise interiorly disjoint paths grid one-to-one correspondence with its vertex set such that two vertices are adjacent if and only corresponding touch at grid-point. If every path has most k bends some ? 0 , said to be B -CPG....

in this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. the error dynamics of each player depends on its neighbors’ information. detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. the introduced reinforcement learning-based algorithms learn online the approximate solution...

Search-Based Testing (SBT) uses an evolutionary algorithm to generate test cases. Traditionally, a random selection is used to generate an initial population and also, less often, during the evolution process. Such selection is likely to achieve lower coverage than a guided selection. We define two novel concepts: (1) a constrained population generator (CPG) that generates a diversified initial...

We propose a novel neural network architecture, called autoencoder-constrained graph convolutional network, to solve node classification task on domains. As suggested by its name, the core of this model is operating directly graphs, whose hidden layers are constrained an autoencoder. Comparing with vanilla networks, autoencoder step added reduce information loss brought Laplacian smoothing. con...

This paper starts by discussing an algorithmic view of labeled path problems. In particular, we apply Seidel’s all-pairs shortest-path algorithm for undirected and unweighted graphs to a basic problem in labeled paths. Seidel’s algorithm is applied to find unlabeled paths between any pairs of nodes in a labeled graph whose associated context-free grammar G can generate the empty string . Our re...