Abstract
Simulated Annealing, a wide-spread technique for combinatorial optimisation, is employed to
find the optimal candidate in a candidate set, as defined in Optimality Theory (OT). Being a
heuristic techniques, simulated annealing does not guarantee to return the correct solution, and
yet, some result is always returned within a constant time. Similarly to language
... read more