Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Ronald de Haan"'
Autor:
Ronald de Haan, Stefan Szeider
Publikováno v:
Algorithms, Vol 12, Iss 9, p 188 (2019)
We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not. These problems are parameterized versions of problems whose complexity lies at the second
Externí odkaz:
https://doaj.org/article/9adc8f3407254d1da3e985da5a930817
Publikováno v:
Transactions on Human-Robot Interaction, 12(1):6. Association for Computing Machinery (ACM)
ACM Transactions on Human-Robot Interaction, 12
ACM Transactions on Human-Robot Interaction, 12, 1
ACM Transactions on Human-Robot Interaction, 12
ACM Transactions on Human-Robot Interaction, 12, 1
Contains fulltext : 286457.pdf (Publisher’s version ) (Closed access) Over the last 20 years, human interaction with robot swarms has been investigated as a means to mitigate problems associated with the control and coordination of such swarms by e
Autor:
Arthur Boixel, Ronald De Haan
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:5194-5201
In a collective decision-making process, having the possibility to provide non-expert agents with a justification for why a target outcome is a good compromise given their individual preferences, is an appealing idea. Such questions have recently bee
Autor:
Iris van Rooij, Marieke Sweers, Mark Blokpoel, Ronald de Haan, Maria Otworowska, Patricia Rich, Todd Wareham
Publikováno v:
Synthese, 198, 5749-5784
Synthese, 198, 6, pp. 5749-5784
Synthese
Synthese, 198(6). Springer Netherlands
Synthese, 198, 6, pp. 5749-5784
Synthese
Synthese, 198(6). Springer Netherlands
Contains fulltext : 219482.pdf (Publisher’s version ) (Open Access) Many compelling examples have recently been provided in which people can achieve impressive epistemic success, e.g. draw highly accurate inferences, by using simple heuristics and
Publikováno v:
Autonomous Agents and Multi-Agent Systems
Egalitarian considerations play a central role in many areas of social choice theory. Applications of egalitarian principles range from ensuring everyone gets an equal share of a cake when deciding how to divide it, to guaranteeing balance with respe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef6f2d3d63580e43493b6bd55306c63e
http://arxiv.org/abs/2102.02785
http://arxiv.org/abs/2102.02785
Publikováno v:
Proceedings of the Annual Meeting of the Cognitive Science Society, vol 43, iss 43
Author(s): Rich, Patricia; de Haan, Ronald; Wareham, Todd; van Rooij, Iris | Abstract: Cognitive science is itself a cognitive activity. Yet, computational cognitive science tools are seldom used to study (limits of) cognitive scientists' thinking. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00b31546ed3d1e239ad36ba5e5d4dd6b
https://escholarship.org/uc/item/8cr8x1c4
https://escholarship.org/uc/item/8cr8x1c4
Autor:
Todd Wareham, Marieke Woensdregt, Ronald de Haan, Mark Blokpoel, Iris van Rooij, Matthew Spike
Publikováno v:
Proceedings of the Annual Meeting of the Cognitive Science Society, vol 43, iss 43
Author(s): Woensdregt, Marieke S; Spike, Matthew; de Haan, Ronald; Wareham, Todd; van Rooij, Iris; Blokpoel, Mark | Abstract: Computational model simulations have been very fruitful for gaining insight into how the systematic structure we observe in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d930b81e2e204eee6e4e22190c82b9d3
https://escholarship.org/uc/item/021734q4
https://escholarship.org/uc/item/021734q4
Publikováno v:
ACM Transactions on Computation Theory, 12(4):22. Association for Computing Machinery (ACM)
Impagliazzo et al. proposed a framework, based on the logic fragment defining the complexity class SNP, to identify problems that are equivalent to k -CNF- Sat modulo subexponential-time reducibility (serf-reducibility). The subexponential-time solva
Publikováno v:
The journal of artificial intelligence research
Journal of Artificial Intelligence Research, 69. Morgan Kaufmann Publishers, Inc.
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2020, 69, pp.687-731. ⟨10.1613/jair.1.11970⟩
Journal of Artificial Intelligence Research, 69. Morgan Kaufmann Publishers, Inc.
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2020, 69, pp.687-731. ⟨10.1613/jair.1.11970⟩
International audience; We provide a comprehensive analysis of the computational complexity of the outcome determination problem for the most important aggregation rules proposed in the literature on logic-based judgment aggregation. Judgment aggrega
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e213ecbf91fdc1f8f3f76cf5cff1ec4
https://hdl.handle.net/11250/2753919
https://hdl.handle.net/11250/2753919
Publikováno v:
Topics in Cognitive Science, 12, 1382-1402
Topics in Cognitive Science, 12, 4, pp. 1382-1402
Topics in Cognitive Science, 12(4), 1382-1402. Wiley-Blackwell
Topics in Cognitive Science
Topics in Cognitive Science, 12, 4, pp. 1382-1402
Topics in Cognitive Science, 12(4), 1382-1402. Wiley-Blackwell
Topics in Cognitive Science
The challenge of explaining how cognition can be tractably realized is widely recognized. Classical rationality is thought to be intractable due to its assumptions of optimization and/or domain generality, and proposed solutions therefore drop one or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebba8c05d8dbbb4061e16c8758977328
http://hdl.handle.net/2066/219579
http://hdl.handle.net/2066/219579