Modern programming languages have little or no support for querying objects and collections. Programmers are forced to hand code such queries using nested loops, which is both cumb...
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
In the last years, distributed coordinator-free systems, e.g., peerto-peer systems (P2P systems), have attracted much interest among researchers and practitioners. In these system...
A non-regenerative dual-hop wireless system based on distributed Alamouti space-time coding is considered. It is assumed that each relay retransmits an appropriately scaled space-t...