In this paper we propose the "Classification-Based Learning of Subsumption Relations for the Alignment of Ontologies" (CSR) method. Given a pair of concepts from two onto...
Vassilis Spiliopoulos, Alexandros G. Valarakos, Ge...
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
—We present a cooperative spatial reuse (CSR) scheme as a cooperative extension of the current TDMAbased MAC to enable spatial reuse in multi-rate wireless networks. We model spa...
Chenguang Lu, Frank H. P. Fitzek, Patrick C. F. Eg...
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...