Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...
With the overwhelming number of reports on similar events originating from different sources on the web, it is often hard, using existing web search paradigms, to find the origi...