In this paper we propose refinements for optimal search with symbolic pattern databases in deterministic statespace planning. As main memory is limited, external heuristic search is combined with the power of symbolic representation. We start with an external version of symbolic breadth-first search. Then an alternative and external implementation for BDDA* to include different heuristic evalua...

The article describes the concept of a unified information space and an algorithm its formation using special computer system. process incoming object search in is considered, which makes it possible to uniquely identify by corresponding features. One main tasks that each identified. For this, identification method was used, based on step-by-step analysis characteristics. parallel spaces propos...

Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...

There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be leveraged to substantially improve the efficiency of externalmemory graph search. This paper introduces a technique, called edge partitioning, which exploits a form of local structure that has not been considered in pr...

purpose: the aim of this study was to investigate the barriers to information seeking behaviors (in the phases of needs identification, information seeking, designing search strategy formula, and using information) of faculty members of islamic azad university of shiraz based on the expansion of dervin’s sense making theory (kari’s theory). methodology: this is an applied study using the survey...

The external profile is among the first examined shape parameters of digital search trees in connection with the performance of unsuccessful search of a random query in the early 1970s. However, finer and important properties beyond the mean such as the variance and the limit law have remained unknown. In this extended abstract, we describe the first results for the asymptotic variance and the ...

Due to the explosive growth of online video data and images , visual search is becoming an important area of research. Most existing approaches used text based image retrieval which is not so efficient. To precisely specify the visual documents, Visual search reranking is used. Visual search reranking is the rearrangement of visual documents based on initial search results or some external know...

The number of learning situations that can be carried out in a VLE (Virtual Learning Environment) can be improved by the integration of third-party external tools. Before the integration takes place, it is compulsory to retrieve some information, both to select the most appropriate tool to support an specific situation and to be able to integrate it in the VLE. Current tool registries have some...