Results 221 to 230 of about 408,117 (264)
Some of the next articles are maybe not open access.
An Efficient Distributed Search Method
2005The big challenge of constructing P2P applications is how to implement efficient distributed file searching in complex environment which implies huge-amount users and uncontrollable nodes. FriendSearch is introduced to improve the efficiency and scalability of distributed file searching.
Haitao Chen, Zhenghu Gong, Zunguo Huang
openaire +1 more source
Distributed sequences and search process
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004An analytical approach to a search process for a set of M fixed sequences in random data covers the problems of a search for the sequences with errors, as well as of a search for the distributed sequences. It is of greater practical interest than the formerly analysed case of search for a single sequence.
Dragana Bajic, Jakov Stojanovic
openaire +1 more source
Scalable Algorithms for Distribution Search
2009 Ninth IEEE International Conference on Data Mining, 2009Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data mining for large distribution sets. Given n distributions of multiple categories and a query distribution Q, we want to find similar clouds (i.e., distributions), to discover ...
Yasuko Matsubara +2 more
openaire +1 more source
CONFLICTING AGENTS IN DISTRIBUTED SEARCH
International Journal on Artificial Intelligence Tools, 2005We extend here the work on interleaved distributed graph based backjumping, IDIBT/GBJ7,6,5 by considering conflicting agents.13 The resulting method IDIBT/CBJ-DkC for Conflict-directed Back-Jumbing and Directed k-Consistency combines distributed and parallel explorations of search spaces with more efficient backtrack steps.
openaire +1 more source
Distributional semantics for diachronic search
Computers & Electrical Engineering, 2018This article describes a system aimed at searching for word similarity over different time periods. The strategy is based on distributional models obtained from a chronologically structured language resource, namely Google Books Syntactic Ngrams. The models were created using dependency-based contexts and a strategy for reducing the vector space, which
Pablo Gamallo 0001 +2 more
openaire +1 more source
Distributed search in P2P networks
IEEE Internet Computing, 2002Most Web content is invisible to current search engines. JXTA Search addresses this problem, providing a unique query routing protocol that makes content visible and facilitates its use.
Steve R. Waterhouse +3 more
openaire +1 more source
Distributed Heuristic Synthesis Search
Journal of Chemical Information and Computer Sciences, 1998The Stony Brook SYNCHEM program, a well-established intelligent problem-solving system for synthesis route discovery, recently has been upgraded to execute in a network of multiprocessor workstations under both Linda tuple space and PVM message passing protocols. We describe the implementation and report experimental results.
Daren Krebsbach +2 more
openaire +1 more source
Parallel searching in distributed databases
Computer Networks (1976), 1980Abstract The problem of finding optimal distribution of a database over a computer network to facilitate parallel searching for a set of database queries is analysed in this paper. The parallel searching of multiple segments required by the queries lowers the response time considerably. Procedures for finding the optimal distributions in a network to
openaire +1 more source
A deeper and distributed search for culture
Behavioral and Brain Sciences, 2020Abstract The target article does not address the neural mediation of complex social behavior. I review evidence that such mediation may be compatible with proposed Bayesian information-processing principles. Notably, however, such mediation occurs subcortically as well as cortically, concerns reward uncertainty and information uncertainty, and ...
openaire +2 more sources
Efficient distributed selective search
Information Retrieval Journal, 2016Simulation and analysis have shown that selective search can reduce the cost of large-scale distributed information retrieval. By partitioning the collection into small topical shards, and then using a resource ranking algorithm to choose a subset of shards to search for each query, fewer postings are evaluated.
Yubin Kim 0001 +3 more
openaire +4 more sources