5316 search results - page 39 / 1064 » Which Search Problems Are Random |
107
Voted
SLS
2009
Springer
15 years 7 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
109
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
105
click to vote
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
We investigate how people interact with Web search engine result pages using eye-tracking. While previous research has focused on the visual attention devoted to the 10 organic se...
111
Voted
EAAI
2007
15 years 20 days ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
114
Voted
SIGMETRICS
2010
ACM
14 years 11 months ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...