74 citations · 191 across the 6 of their papers we have counts for
6 papers
Predicting SLA Violations in Real Time using Online Machine Learning
Jawwad Ahmed, Andreas Johnsson, Rerngvit Yanggratoke +3
Detecting faults and SLA violations in a timely manner is critical for telecom providers, in order to avoid loss in business, revenue and reputation. At the same time predicting SL…
The Accuracy of Tree-based Counting in Dynamic Networks
Supriya Krishnamurthy, John Ardelius, Erik Aurell +3
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn,…
Exhaustive enumeration unveils clustering and freezing in random 3-SAT
John Ardelius, Lenka Zdeborová
We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters correspo…
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…
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…
Behavior of heuristics and state space structure near SAT/UNSAT transition
John Ardelius, Erik Aurell
We study the behavior of ASAT, a heuristic for solving satisfiability problems by stochastic local search near the SAT/UNSAT transition. The heuristic is focused, i.e. only variabl…