Todd Wareham

Marieke Sweers

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

Creating Teams of Simple Agents for Specified Tasks: A Computational Complexity Perspective.

[BibT_eX]

[DOI]

CoRR, 2022

Computational Complexity of Segmentation.

[BibT_eX]

[DOI]

Federico Adolfi

Proceedings of the 44th Annual Meeting of the Cognitive Science Society, 2022

2021

Naturalism, tractability and the adaptive toolbox.

[BibT_eX]

[DOI]

Synth., 2021

Why is scaling up models of language evolution hard?

[BibT_eX]

[DOI]

Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

How hard is cognitive science?

[BibT_eX]

[DOI]

Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

The Computational Complexity of Designing Scalar-Field Sensing Robot Teams and Environments for Distributed Construction (Extended Abstract).

[BibT_eX]

[DOI]

Andrew Vardy

Proceedings of the IEEE International Conference on Autonomic Computing and Self-Organizing Systems, 2021

2019

Designing Robot Teams for Distributed Construction, Repair, and Maintenance.

[BibT_eX]

[DOI]

ACM Trans. Auton. Adapt. Syst., 2019

Cognition and intractability: a guide to classical and parameterized complexity analysis.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9781107358331, 2019

2018

Viable Algorithmic Options for Designing Reactive Robot Swarms.

[BibT_eX]

[DOI]

Andrew Vardy

ACM Trans. Auton. Adapt. Syst., 2018

Rational analysis, intractability, and the prospects of 'as if'-explanations.

[BibT_eX]

[DOI]

Synth., 2018

Putting it together: the computational complexity of designing robot controllers and environments for distributed construction.

[BibT_eX]

[DOI]

Andrew Vardy

Swarm Intell., 2018

Deep Analogical Inference as the Origin of Hypotheses.

[BibT_eX]

[DOI]

J. Probl. Solving, 2018

Demons of Ecological Rationality.

[BibT_eX]

[DOI]

Cogn. Sci., 2018

The Computational Complexity of Controller-Environment Co-design Using Library Selection for Distributed Construction.

[BibT_eX]

[DOI]

Mesam Timmar

Proceedings of the Distributed Autonomous Robotic Systems, 2018

2017

Community-based influence maximization in social networks under a competitive linear threshold model.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2017

The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective.

[BibT_eX]

[DOI]

J. Probl. Solving, 2017

2016

Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms.

[BibT_eX]

[DOI]

EAI Endorsed Trans. Serious Games, 2016

On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems.

[BibT_eX]

[DOI]

Marieke Sweers

EAI Endorsed Trans. Self Adapt. Syst., 2016

On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities.

[BibT_eX]

[DOI]

EAI Endorsed Trans. Self Adapt. Syst., 2016

2015

How did Homo Heuristicus Become Ecologically Rational?

[BibT_eX]

[DOI]

Proceedings of the EuroAsianPacific Joint Conference on Cognitive Science / 4th European Conference on Cognitive Science / 11th International Conference on Cognitive Science, 2015

How did Homo Heuristicus become ecologically rational?

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Meeting of the Cognitive Science Society, 2015

Bridging the communicative gap between robots and humans, by analogy.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Meeting of the Cognitive Science Society, 2015

Machiavellian agents: Player modelling to deceive and be deceived.

[BibT_eX]

[DOI]

Proceedings of the Computer Games: AI, 2015

Exploring options for efficiently evaluating the playability of computer game agents.

[BibT_eX]

[DOI]

Scott Watson

Proceedings of the Computer Games: AI, 2015

2014

Resource-bounded Problem Solving (Dagstuhl Seminar 14341).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

Can Tractable Algorithmic-level Explanations Be Evolved?

[BibT_eX]

[DOI]

Arne Wijnia

Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

Assessing the computational adequacy of the General Problem Solver model.

[BibT_eX]

[DOI]

Zahra Sajedinia

Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

2013

Phon: A Computational Basis for Phonological Database Building and Model Testing.

[BibT_eX]

[DOI]

Proceedings of the Cognitive Aspects of Computational Language Acquisition, 2013

Closer than you think?: Options for efficiently approximating optimal analogies under Structure Mapping Theory.

[BibT_eX]

[DOI]

Tijl Grootswagers

Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Computational complexity analysis for cognitive scientists.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Modeling the genesis of a novel communicative system.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

2012

Intractability and the use of heuristics in psychological explanations.

[BibT_eX]

[DOI]

Cory D. Wright

Synth., 2012

Flyby: Life Before, During, and After Graduate Studies with Mike Fellows.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective.

[BibT_eX]

[DOI]

J. Probl. Solving, 2011

On the computational challenges of analogy-based generalization.

[BibT_eX]

[DOI]

Cogn. Syst. Res., 2011

Bayesian Intractability Is Not an Ailment That Approximation Can Cure.

[BibT_eX]

[DOI]

Johan Kwisthout

Cogn. Sci., 2011

Ignorance is bliss: A complexity perspective on adapting reactive architectures.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Development and Learning and on Epigenetic Robotics, 2011

The computational costs of recipient design and intention recognition in communication.

[BibT_eX]

[DOI]

Proceedings of the 33th Annual Meeting of the Cognitive Science Society, 2011

2009

Fixed-parameter tractability of anonymizing data by suppressing entries.

[BibT_eX]

[DOI]

Rhonda Chaytor

J. Comb. Optim., 2009

2008

Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities.

[BibT_eX]

[DOI]

Comput. J., 2008

2007

Approximating Solution Structure.

[BibT_eX]

[DOI]

Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

2006

The Parameterized Complexity of Enumerating Frequent Itemsets.

[BibT_eX]

[DOI]

Matthew Hamilton

Rhonda Chaytor

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2004

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2004

2003

On the complexity of finding common approximate substrings.

[BibT_eX]

[DOI]

Andrew D. Smith

Harold T. Wareham

Theor. Comput. Sci., 2003

2002

Optimal algorithms for local vertex quartet cleaning.

[BibT_eX]

[DOI]

Gianluca Della Vedova

Bioinform., 2002

2001

Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract).

[BibT_eX]

[DOI]

Harold T. Wareham

Proceedings of the 6th Pacific Symposium on Biocomputing, 2001

2000

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Systematic parameterized complexity analysis in computational phonology.

[BibT_eX]

[DOI]

PhD thesis, 1999

Quartet Cleaning: Improved Algorithms and Simulations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Jennifer Cole, Georgia M. Green and Jerry L. Morgan, editors, <i>Linguistics and Computation</i>. CLSI Lecture Notes no 52. Stanford, CA: CLSI, 1995. ISBN 1 881526 81 X, £14.95, xi+296 pages.

[BibT_eX]

[DOI]