In the GCC team at ARM we use LNT for performance tracking. We build a JSON representation of our benchmark data, and then importing it to LNT for analysis and visualization. We make regular builds, ...

Abstract: It has been witnessed that the learned data compression techniques has outperformed conventional ones. However, the non-deterministic floating-point calculation makes the probability ...

In graph theory, a dominating set for a graph $G$ is a subset $D$ of its vertices, such that any vertex of $G$ is in $D$, or has a neighbor in $D$. The minimum ...

An overview of Aunu numbers, Aunu permutations patterns, the 123 and 132 avoiding patterns and their applications was reported by the authors in [2] . This paper considered the prime enumerative ...

Ah, line graph examples - those mysterious, squiggly hieroglyphs of the data world. You’ve probably encountered them more times than you can count - in reports, presentations, etc. Yet, deciphering ...

Abstract: Graph coloring is one of the most studied combinatorial optimization problems that can be used to model several practical problems. This paper develops a reduction of job shop scheduling ...

Wang tiles enable efficient pattern compression while avoiding the periodicity in tile distribution via programmable matching rules. However, most research in Wang tilings has considered tiling the ...

ABSTRACT: Randić energy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randić energy REC (G) of a graph G in this paper. This ...

Description : There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where graph[i] is an integer array of nodes ...