Print Email Facebook Twitter Improving on Very Large Neighborhood Search techniques in Program Synthesis Title Improving on Very Large Neighborhood Search techniques in Program Synthesis Author Hellinga, Rixt (TU Delft Technology, Policy and Management; TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor Dumančić, S. (mentor) Molenaar, M.L. (graduation committee) Degree granting institution Delft University of Technology Programme Computer Science and Engineering Project CSE3000 Research Project Date 2022-06-24 Abstract Inductive Program Synthesis (IPS) has been implemented by a two-stage search algorithm, Brute, and consequently improved upon with a Large Neighborhood Search (LNS) technique, in an algorithm named Vlute. Unmotivated values and design choices within Vlute caused limitations on the performance of IPS tasks. This research improves upon several of these limitations through experiments. Most significant improvements are found in the robot-planning domain through the implementation of a stochastic accept method and a best improvement neighbor search. To reference this document use: http://resolver.tudelft.nl/uuid:9a2392c5-0d1a-4cda-a1ec-83d36ef2abe1 Part of collection Student theses Document type bachelor thesis Rights © 2022 Rixt Hellinga Files PDF Research_Project_Rixt_Hel ... ga_CSE.pdf 943.79 KB Close viewer /islandora/object/uuid:9a2392c5-0d1a-4cda-a1ec-83d36ef2abe1/datastream/OBJ/view