Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
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...
—This paper presents a novel genetic algorithm, termed the Optimum Individual Monogenetic Algorithm (OIMGA) and describes its hardware implementation. As the monogenetic strategy...
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
—We present an empirical usability experiment studying the relative strengths and weaknesses of three different occlusion management techniques for discovering and accessing obje...