359 citations · 1.5k across the 43 of their papers we have counts for
4 papers · 1 filter
Circumspect descent prevails in solving random constraint satisfaction problems
Mikko Alava, John Ardelius, Erik Aurell +4
We study the performance of stochastic local search algorithms for random instances of the -satisfiability (-SAT) problem. We introduce a new stochastic local search algorith…
Comparing Maintenance Strategies for Overlays
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell +1
In this paper, we present an analytical tool for understanding the performance of structured overlay networks under churn based on the master-equation approach of physics. We motiv…
An Analytical Study of a Structured Overlay in the presence of Dynamic Membership
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell +1
In this paper we present an analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a fluid model approach to describe steady-state or transi…
Clustering of solutions in hard satisfiability problems
John Ardelius, Erik Aurell, Supriya Krishnamurthy
We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarit…