In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...
Raad S. Al-Qassas, Lewis M. Mackenzie, Mohamed Oul...
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...