We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of nar...
Sanskrit is very rich in compound formation. Typically a compound does not code the relation between its components explicitly. To understand the meaning of a compound, it is neces...
In this paper, we consider a packet scheduler exploiting multiuser diversity in a wireless network with AMC (Adaptive Modulation and Coding), and propose a packet level performance...
A translation is a conversion from a source language into a target language preserving the meaning. A huge number of techniques and computational approaches have been experimented...