Results 211 to 220 of about 408,117 (264)

Strategies for distributed search

Proceedings of the 1992 ACM annual conference on Communications - CSC '92, 1992
The problem of locating information among cooperating agents within a distributed computing environment is considered. Such collections of agents can be collectively thought of as a single distributed application providing a single set of services; the X.500 distributed directory is an example of such an application.
Michael A. Bauer 0001, Tong Wang
openaire   +1 more source

Predictive search distributions

Proceedings of the 23rd international conference on Machine learning - ICML '06, 2006
Estimation of Distribution Algorithms (EDAs) are a popular approach to learn a probability distribution over the "good" solutions to a combinatorial optimization problem. Here we consider the case where there is a collection of such optimization problems with learned distributions, and where each problem can be characterized by some vector of features.
Edwin V. Bonilla, Christopher K. I. Williams, Felix V. Agakov, John Cavazos, John Thomson, Michael F. P. O'Boyle   +5 more
openaire   +1 more source

Distributed constrained heuristic search

IEEE Transactions on Systems, Man, and Cybernetics, 1991
In this paper we present a model of decentralized problem solving, called Distributed Constrained Heuristic Search (DCHS) that provides both structure and focus in individual agent search spaces so as to optimize decisions in the global space. The model achieves this by integrating decentralized constraint satisfaction and heuristic search.
Katia P. Sycara, Steven P. Roth, Norman M. Sadeh, Mark S. Fox   +3 more
openaire   +1 more source

The Theory of Search: Optimum Distribution of Search Effort

Management Science, 1958
This paper will be concerned with formulating the optimum allocation of search effort as a problem in convex programming so that their solutions may be made amenable to treatment by the adjacent extreme point methods of linear programming. Attention will be concentrated on discrete (statistical) distributions because this class of cases admits of the ...
A. Charnes, W. W. Cooper
openaire   +1 more source

Distributed Analytical Search

2015
The main purpose of this research is to develop an agent-based Distributed Analytical Search (DAS) tool to search and query distributed data sources regardless of data’s location, content or format from a natural language query.
Subrata Das, Ria Ascano, Matthew Macarty
openaire   +1 more source

Search operations on distributed directories

Proceedings ICCI `92: Fourth International Conference on Computing and Information, 2003
The ISO's X.500 directory service provides agents with information about entities within a distributed environment. The standard identifies information (entry data) to be maintained by the directory as well as information (knowledge) that is used by the directory agents to facilitate cooperative activity, such as searching, updating and manipulating ...
Michael Bauer, Arin Zahalka
openaire   +1 more source

Distributed On-line Bayesian Search

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2006
In this paper, we outline the basis for a new distributed Bayesian search scheme in which all Bayesian decision makers recognize the same performance objective but do not possess the ability to communicate with each other. Coordination among the players is achieved indirectly by tracking search performance.
Alfredo García 0001, Enrique Campos, Chenyang Li   +2 more
openaire   +1 more source

Distributed trajectory similarity search

Proceedings of the VLDB Endowment, 2017
Mobile and sensing devices have already become ubiquitous. They have made tracking moving objects an easy task. As a result, mobile applications like Uber and many IoT projects have generated massive amounts of trajectory data that can no longer be processed by a single machine efficiently.
Dong Xie 0001, Feifei Li 0001, Jeff M. Phillips   +2 more
openaire   +1 more source

Towards a Distributed Search Engine [PDF]

, 2010
In this invited talk we address the algorithmic problems behind a truly distributed Web search engine. The main goal is to reduce the cost of a Web search engine while keeping all the benefits of a centralized search engine in spite of the intrinsic network latency imposed by Internet.
openaire   +3 more sources

Quickest search for a rare distribution

2012 46th Annual Conference on Information Sciences and Systems (CISS), 2012
We consider the problem of finding one sequence of independent random variables following a rare atypical distribution, P 1 , amongst a large number of sequences following some null distribution, P 0 . We quantify the number of samples needed to correctly identify one atypical sequence as the atypical sequences become increasingly rare.
Matthew Malloy, Gongguo Tang, Robert D. Nowak   +2 more
openaire   +1 more source