Research Seminar
Heaps Abstract : The problem of finding the nth smallest number in a collection is known as the selection problem. But what if the collection of numbers is not directly accessible to us? This is what explorable [...] problem , known as Weighted k-Set Packing . Given a collection of sets each of which contains up to k elements, we would like to find a collection of sets that are pairwise non-intersecting . One can [...] automatically model the progress of algorithm setups on different problem instances based on data collected in experiments, 2) use these models to discover clusters of algorithm (or problem instance) behaviors