5316 search results - page 353 / 1064 » Which Search Problems Are Random |
317
click to vote
CP
2009
Springer
16 years 8 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
203
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
In some retrieval situations, a system must search across multiple collections. This task, referred to as federated search, occurs for example when searching a distributed index o...
185
click to vote
SAT
2009
Springer
16 years 2 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
195
click to vote
WECWIS
2007
IEEE
16 years 1 months ago
2007
IEEE
In e-commerce environment, business partners exchange product information in the form of ecatalogs. Since each business player uses his/her own classification and identification c...
194
click to vote
SIGIR
2004
ACM
16 years 26 days ago
2004
ACM
: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search en...