This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...