Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Time...
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative ap...
Abhishek Arun, Barry Haddow, Philipp Koehn, Adam L...