8 citations · 12 across the 7 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.SE2021
Mandating Code Disclosure is Unnecessary -- Strict Model Verification Does Not Require Accessing Original Computer Code
Sasanka Sekhar Chanda
Mandating public availability of computer code underlying computational simulation modeling research ends up doing a disservice to the cause of model verification when inconsistenc…
cs.AI2021★ 1 cited
An Algorithm to Effect Prompt Termination of Myopic Local Search on Kauffman-s NK Landscape
Sasanka Sekhar Chanda
In Kauffman-s NK model, myopic local search involves flipping one randomly-chosen bit of an N-bit decision string in every time step and accepting the new configuration if that has…
cs.NE2021
Overcoming Complexity Catastrophe: An Algorithm for Beneficial Far-Reaching Adaptation under High Complexity
Sasanka Sekhar Chanda, Sai Yayavaram
In his seminal work with NK algorithms, Kauffman noted that fitness outcomes from algorithms navigating an NK landscape show a sharp decline at high complexity arising from pervasi…