An overview of search strategies in distributed environments
نویسندگان
چکیده
منابع مشابه
An overview of search strategies in distributed environments
Distributed systems are populated by a large number of heterogeneous entities that join and leave the systems dynamically. These entities act as clients and providers and interact with each other in order to get a resource or to achieve a goal. To facilitate the collaboration between entities the system should provide mechanisms to manage the information about which entities or resources are av...
متن کاملAn Overview of Search Engine Evaluation Strategies
Basically evaluation of search engine is the process of making judgment about the value, importance and quality of search engine, after considering search engines carefully. The evaluation of search engines has not been keeping up with the advancement of their development. Web search engines work differently based on different mode of interface, features, coverage of the web, ranking methods, d...
متن کاملTest strategies in distributed software development environments
Distributed software development has resulted in formation of business partners spread across different economic, temporal, and organizational zones collaborating together for shared authorship of evolving software artifacts. However, the distributed approach is not without risks, and organizations implement specific test strategies to assist in the verification process of work-in-progress soft...
متن کاملStrategies for Cooperative Search in Distributed Databases
We consider the problem of searching a set of data repositories, each managed by an independent agent which is able to handle queries from users, as well as queries from peer agents. Given a query, an agent’s task is to find a closest match to the query over all the distributed databases. The agents search the distributed databases cooperatively by routing queries with each other. However, it i...
متن کاملAnalysis of Distributed-Search Contraction-Based Strategies
We present a model of parallel search in theorem proving for forward-reasoning strategies, with contraction and distributed search. We extend to parallel search the bounded-search-spaces approach to the measurement of infinite search spaces, capturing both the advantages of parallelization, e.g., the subdivision of work, and its disadvantages, e.g., the cost of communication, in terms of search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Knowledge Engineering Review
سال: 2013
ISSN: 0269-8889,1469-8005
DOI: 10.1017/s0269888913000143