4553 search results - page 284 / 911 » Distributed Ranked Search |
177
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
180
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents a two-sided economic search model in which agents are searching for beneficial pairwise partnerships. In each search stage, each of the agents is randomly mat...
184
click to vote
PVM
2004
Springer
16 years 16 days ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
183
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...
208
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...