We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
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...
— this paper proposes a distributed routing protocol for ad hoc sensor networks which uses Fuzzy Logic. Each sensor uses a Fuzzy decision making process to find the best Cluster ...
Benchmarks have been used in computer science to compare the performance of computer systems, information retrieval algorithms, databases, and many other technologies. The creatio...
Susan Elliott Sim, Steve M. Easterbrook, Richard C...
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...