It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
We present a new estimator for counting the number of solutions of a Boolean satisļ¬ability problem as a part of an importance sampling framework. The estimator uses the recently...
Behind every search query is a high-level mission that the user wants to accomplish. While current search engines can often provide relevant information in response to well-speciļ...
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
This paper discusses applying the social behaviour of bees to the web search. We proposed an on-line search of the userās predeļ¬ned group of pages. In particular, this approac...