70 citations · 138 across the 3 of their papers we have counts for
3 papers
cs.AI2011★ 37 cited
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
L. Barbulescu, A. E. Howe, M. Roberts +1
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet,…
cs.AI2011★ 31 cited
Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search
A. E. Howe, J. P. Watson, L. D. Whitley
Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread su…
cs.AI2011★ 70 cited
A Critical Assessment of Benchmark Comparison in Planning
E. Dahlman, A. E. Howe
Recent trends in planning research have led to empirical comparison becoming commonplace. The field has started to settle into a methodology for such comparisons, which for obvious…