The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
Purpose: To provide a critical review of Bergman’s 2001 study on the Deep Web. In addition, we bring a new concept into the discussion, the Academic Invisible Web (AIW). We defi...
Various cryptosystems exploit exhaustive techniques to search, missing-the-mark, key space. Such search techniques should be guided in order to be computationally adequate. Here, ...
Hasan Mohammed Hasan Husein, Bayoumi I. Bayoumi, F...
In this paper, we develop techniques based on evolvability statistics of the fitness landscape surrounding sampled solutions. Averaging the measures over a sample of equal fitness...
Tom Smith, Phil Husbands, Paul J. Layzell, Michael...
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...