5606 search results - page 600 / 1122 » Randomization Techniques for Graphs. |
177
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
170
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We investigate in this paper the performance of a file sharing principle similar to the one implemented by eMule. For this purpose, we consider a system composed of N peers becomi...
170
click to vote
JSAT
2008
15 years 7 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
166
click to vote
JACM
2007
15 years 7 months ago
2007
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
175
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...