5316 search results - page 337 / 1064 » Which Search Problems Are Random |
218
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
205
click to vote
CN
2006
15 years 7 months ago
2006
Abstract-- Overlay networks are application layer systems which facilitate users in performing distributed functions such as searches over the contents of other users. An important...
268
click to vote
IICS
2010
Springer
15 years 11 months ago
2010
Springer
: We address the problem of evaluating peer-to-peer information retrieval (P2PIR) systems with semantic overlay structure. The P2PIR community lacks a commonly accepted testbed, su...
148
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
217
Voted
CORR
2011
Springer
15 years 2 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...