most citedUnweighted Stochastic Local Search can be Effective for Random CSP Benchmarks

11 citations · 11 across the 1 of their papers we have counts for

collaborators

2 papers

cs.AI2018

Stepping Stones to Inductive Synthesis of Low-Level Looping Programs

Christopher D. Rosin

Inductive program synthesis, from input/output examples, can provide an opportunity to automatically create programs from scratch without presupposing the algorithmic form of the s…

cs.AI2014★ 11 cited

Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks

Christopher D. Rosin

We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction problems (CSP). ULSA is many times faster than the prior state of the art on a…