Presents an improved inverted region quadtree variation called Dynamic Inverted Quadtree that is able to support and index a pictorial database. Pattern-searching algorithms are described, and the space needs of Fully Inverted and Dynamic Inverted Quadtrees are analytically compared based on a model of image randomness expressed as a branching…

Discusses the results of modeling the performance of searching large text databases via various parallel hardware architectures and search algorithms. The performance under load and the cost of each configuration are compared, and a common search workload used in the modeling is described. (Contains 26 references.) (LRW)

In machine learning there is considerable interest in techniques which improve planning ability. Initial investigations have identified a wide variety of techniques to address this issue. Progress has been hampered by the utility problem, a basic tradeoff between the benefit of learned knowledge and the cost to locate and apply relevant knowledge.…