Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Venable, K. B."'
Publikováno v:
Journal Of Artificial Intelligence Research, Volume 27, pages 617-674, 2006
In real-life temporal scenarios, uncertainty and preferences are often essential and coexisting aspects. We present a formalism where quantitative temporal constraints with both preferences and uncertainty can be defined. We show how three classical
Externí odkaz:
http://arxiv.org/abs/1110.2212
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market. In the classical formulation, n men and n
Externí odkaz:
http://arxiv.org/abs/1007.0859
Publikováno v:
Proceedings of the 2022 AAAI/ACM Conference on AI, Ethics, and Society.
Combining Fast and Slow Thinking for Human-like and Efficient Navigation in Constrained Environments
Autor:
Ganapini, M. B., Campbell, M., Fabiano, F., Horesh, L., Lenchner, J., Loreggia, A., Mattei, N., Rossi, F., Srivastava, B., Venable, K. B.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3662::659fd67104f759c559961df91e6a7d94
https://hdl.handle.net/11379/571269
https://hdl.handle.net/11379/571269
Publikováno v:
Scopus-Elsevier
We study the computational complexity of finding the next most preferred solution in some common formalisms for representing constraints and preferences. The problem is computationally intractable for CSPs, but is polynomial for tree-shaped CSPs and