Search Results for author:
Found 2 papers, 1 papers with code
Stepping Stones to Inductive Synthesis of Low-Level Looping Programs
We present MAKESPEARE, a simple delayed-acceptance hillclimbing method that synthesizes low-level looping programs from input/output examples.
Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks
We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction problems (CSP).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
