In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...
Jean-Paul Watson, Adele E. Howe, L. Darrell Whitle...
Although worked-out examples play a key role in cognitive skill acquisition, research demonstrates that students have various levels of meta-cognitive abilities for using examples ...