A memory-based heuristic is a function, h(s), stored in the form of a lookup table (pattern database): h(s) is computed by mapping s to an index and then retrieving the appropriate entry in the table. (Korf 1997) conjectures for search using memory-based heuristics that m · t is a constant, where m is the size of the heuristic’s lookup table and t is search time. In this paper we present a meth...

We investigate the relative computational power of three classes of pointer algorithms by comparing time and space usage. These classes include two from Tarjan’s original paper and another class which we introduce which is related to another long standing problem.

Bayesian inference is an important problem with numerous applications in probabilistic reasoning. Counting satisfying assignments is a closely related problem of fundamental theoretical importance. In this paper, we show that plain old DPLL equipped with memoization (an algorithm we call #DPLLCache) can solve both of these problems with time complexity that is at least as good as state-of-the-a...

A fundamental question in learning theory is the quantification of the basic tradeoff between the complexity of a model and its predictive accuracy. One valid way of quantifying this tradeoff, known as the “Information Bottleneck”, is to measure both the complexity of the model and its prediction accuracy by using Shannon’s mutual information. In this paper we show that the Information Bottlene...

Location management plays the central role in providing ubiquitous communications services in the future wireless mobile networks. Location update and paging are commonly used in tracking mobile users on the move, location update is to update a mobile user’s current location while the paging is used to locate a mobile user, both will incur signaling traffic in the wireless networks. The more fr...

Every permutation of {1, 2, . . . , N} can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place using simultaneous swaps in two rounds of swaps. In the case where the permutation is the k-way perfect shuffle we develop two methods for efficiently computing the pair of involutions that accomplishes these swaps. The ...