most citedExploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version)

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing cs.LGShow all

1 paper · 1 filter

cs.LG2022

Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach

Todd Wareham

The key to reconciling the polynomial-time intractability of many machine learning tasks in the worst case with the surprising solvability of these tasks by heuristic algorithms in…