Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
Carsten Franke, Frank Hoffmann, Joachim Lepping, U...
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Background: The popularity of massively parallel exome and transcriptome sequencing projects demands new data mining tools with a comprehensive set of features to support a wide r...