1 citations · 1 across the 5 of their papers we have counts for
5 papers
Viable Algorithmic Options for Creating and Adapting Emergent Software Systems
Todd Wareham, Ronald de Haan
Given the complexity of modern software systems, it is of great importance that such systems be able to autonomously modify themselves, i.e., self-adapt, with minimal human supervi…
Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective
Todd Wareham, Andrew Vardy
Visual and scalar-field (e.g., chemical) sensing are two of the options robot teams can use to perceive their environments when performing tasks. We give the first comparison of th…
Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version)
Todd Wareham, Marieke Sweers
Component-Based Development (CBD) is a popular approach to mitigating the costs of creating software systems. However, it is not clear to what extent the core component selection a…
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…
Creating Teams of Simple Agents for Specified Tasks: A Computational Complexity Perspective
T. Wareham
Teams of interacting and co-operating agents have been proposed as an efficient and robust alternative to monolithic centralized control for carrying out specified tasks in a varie…