-
Cognitive Science: I have used classical and parameterized complexity results to
diagnose the sources of intractability in various theories of cognitive abilities such as
analogy derivation, Bayesian-based reasoning, problem solving, and decision
making; these sources are then used as a guide to revisions of those theories.
Titles of completed student theses and dissertations are:
-
Gentili, S. (2018) "Computational-level Analysis of Insight Problem
Solving." [MSc; co-supervised with Drs. Mark Blokpoel and Iris van Rooij
(Radboud University Nijmegen, Donders Institute for Brain, Cognition, and
Behaviour, Nijmegen, the Netherlands)]
-
Peters, E. (2017) "A Moral Agent Society Simulation System: Exploring the Effects
of Environment on Moral Behaviour." [Undergraduate final project; co-supervised with Drs.
Mark Blokpoel and Iris van Rooij (Radboud
University Nijmegen, Donders Institute for Brain, Cognition, and Behaviour, Nijmegen,
the Netherlands)]
I have co-authored the following publications in this area:
-
Adolfi, F., Wareham, T., and van Rooij, I. (to appear) "Computational
Complexity of Segmentation." In the Proceedings of the 44th Annual Meeting
of the Cognitive Science Society (CogSci 2022).
-
Adolfi, F., Wareham, T., and van Rooij, I. (2022) "Computational
Complexity of Segmentation." CoRR abs/2201.13106 (8 pages).
[PDF]
-
Rich, P., Blokpoel, M., de Haan, R., Otworowska, M., Sweers, M., Wareham, T., and
van Rooij, I. (2021) "Naturalism, Tractability and the Adaptive Toolbox",
Synthese, 198(6), 5749-5784.
-
Rich, P., de Haan, R., Wareham, T., and van Rooij, I. (2021) "How hard
is Cognitive Science?" In the Proceedings of the 43rd Annual Meeting of the
Cognitive Science Society (CogSci 2021). 3034-3040.
-
Woensdregt, M., Spike, M., de Haan, R., Wareham, T., van Rooij, I., and
Blokpoel, M. (2021) "Why is scaling up models of language evolution
hard?" In the Proceedings of the 43rd Annual Meeting of the
Cognitive Science Society (CogSci 2021). 209-215.
-
van Rooij, I., Blokpoel, M., de Haan, R., and Wareham, T. (2019)
"Tractable embodied cognition needs embeddedness".
Italian Journal of Cognitive Sciences, 8(15), 25-38.
-
van Rooij, I., Blokpoel, M., Kwisthout, J., and Wareham, T. (2019)
Cognition and Intractability: A Guide to Classical and Parameterized
Complexity Analysis. Cambridge University Press.
-
Blokpoel, M., Wareham, T., Haselager, P., Toni, I., and van Rooij, I. (2018)
"Deep analogical inference as the origin of hypotheses." Journal of Problem
Solving, 11(1), 3:1-3:24.
-
Otworowska, M., Blokpoel, M., Sweers, M., Wareham, T., and van Rooij, I. (2018) "Demons of
Ecological Rationality." Cognitive Science. 42(3), 1057-1066.
-
van Rooij, I., Wright, C., Kwisthout, J., and Wareham, T. (2018) "Rational Analysis, Intractability and
'As If' Explanations in Cognitive Psychology." Synthese. 195(2), 491-510.
-
Wareham, T. (2017) "The Roles of Internal Representation and Processing in Problem Solving
Involving Insight: A Computational Complexity Perspective." Journal of Problem Solving, 10(1), 3:1-3:17.
-
Robotics: I have used classical and parameterized complexity
results to diagnose the sources of intractability in various problems associated with
the design of groups of one or more reactive robots.
Titles of completed student theses and dissertations are:
-
Timmar, M. (2018)
"The Computational Complexity of Controller-Environment Co-design
using Library Selection for Distributed Construction." [MSc]
I have co-authored the following publications in this area:
-
Wareham, T. (2022) "Creating Teams of Simple Agents for Specified
Tasks: A Computational Complexity Perspective."
CoRR abs/2205.02061 (20 pages).
[PDF]
-
Wareham, T. and Vardy, A. (2022) "Environmental Sensing Options for
Robot Teams: A Computational Complexity Perspective."
CoRR abs/2205.05034 (77 pages).
[PDF]
-
Wareham, T. and Vardy, A. (2021) "The Computational Complexity of
Designing Scalar-field Sensing Robot Teams and Environments for Distributed
Construction (Extended Abstract)." In the Proceedings of the 4th
International Workshop on Self-Organised Construction (SOCO 2021).
2021 IEEE International Conference on Autonomic Computing and
Self-Organizing Systems Companion (ACSOS-C). IEEE Computer Society;
Los Alamitos, CA. 232-237.
-
Wareham, T. (2019) "Designing Robot Teams for Distributed Construction, Repair, and
Maintenance." ACM Transactions on Autonomous and Adaptive Systems, 14(1), 2:1-2:29.
-
Timmar, M. and Wareham, T. (2019) "The Computational Complexity of
Controller-Environment Co-design using Library Selection for Distributed
Construction." In N. Correll, M. Schwager, and M. Otte (Eds.) Distributed
Autonomous Robotic Systems: The 14th International Symposium. Springer
Proceedings in Advance Robotics vol. 9. Springer Nature Switzerland AG.
51-63.
-
Wareham, T. and Vardy, A. (2018) "Viable Algorithmic Options for Designing Reactive Robot
Swarms." ACM Transactions on Autonomous and Adaptive Systems, 13(1), 5:1-5:23.
-
Wareham, T. and Vardy, A. (2018) "Putting It Together: The Computational Complexity of
Designing Robot Controllers and Environments for Distributed Construction." Swarm Intelligence,
12(2), 111-128.
-
Software Engineering: I have used classical and parameterized complexity
results to diagnose the sources of intractability in various problems associated with
the design, reconfiguration, and (re)modularization of software systems.
Titles of completed student dissertations are:
-
Brandt, A. (2017) "On the Formalization and Computational Complexity of Software Modularization"
[BSch]
I have co-authored the following publications in this area:
-
Wareham, T. and de Haan, R. (2022) "Viable Algorithmic Options for Creating
and Adapting Emergent Software Systems.'' CoRR abs/2205.06097 (76 pages)
[PDF]
-
Wareham, T. and Sweers, M. (2022) "Exploring Viable Algorithmic Options for
Automatically Creating and Reconfiguring Component-based Software Systems:
A Computational Complexity Approach (Full Version)."
CoRR abs/2205.05001 (38 pages).
[PDF]
-
Machine Learning: I have used classical and parameterized complexity
to assess the computational difficulty of Learning from Demonstration
(LfD). I have co-authored the following publications in this area:
-
Wareham, T. (2022) "Exploring Viable Algorithmic Options for Learning
from Demonstration (LfD): A Parameterized Complexity Approach."
CoRR abs/2205.04989 (38 pages).
[PDF]
-
Social Networks: I have used classical and parameterized complexity to assess the
computational difficulty of competitive influence maximization in social networks. I
have co-authored the following publications in this area:
-
Bozorgi, A., Samet, S., Kwisthout, J., and Wareham, T. (2017) "Community-based
Influence Maximization in Social Networks under a Competitive Linear Threshold Model."
Knowledge Based Systems,134, 149-158.