Linear Ranking with Reachability

The Hardness of Finding Linear Ranking Functions for Lasso Programs

Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem is known to be in coNP when variables range over the integers and in PTIME for the rational numbers, or real numbers. Here we show that deciding whether a l...

Improving Search Order for Reachability Testing in Timed Automata

Standard algorithms for reachability analysis of timed automata are sensitive to the order in which the transitions of the automata are taken. To tackle this problem, we propose a ranking system and a waiting strategy. This paper discusses the reason why the search order matters and shows how a ranking system and a waiting strategy can be integrated into the standard reachability algorithm to a...

Ranking, Aggregation, and Reachability in Faceted Search with SemFacet

Solving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function

Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

Gene Reachability Using Page Ranking on Gene Co-expression Networks

We modify the Google Page-Rank algorithm, which is primarily used for ranking web pages, to analyze the gene reachability in complex gene co-expression networks. Our modification is based on the average connections per gene. We propose a new method to compute the metric of average connections per gene, inspired by the PageRank algorithm. We calculate this average as eight for human genome data ...