Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Katsirelos, George"'
By concisely representing a joint function of many variables as the combination of small functions, discrete graphical models (GMs) provide a powerful framework to analyze stochastic and deterministic systems of interacting variables. One of the main
Externí odkaz:
http://arxiv.org/abs/2111.12491
Publikováno v:
30th International Joint Conference on Artificial Intelligence (IJCAI-21), Aug 2021, Montreal, Canada
Bayesian networks are probabilistic graphical models with a wide range of application areas including gene regulatory networks inference, risk analysis and image processing. Learning the structure of a Bayesian network (BNSL) from discrete data is kn
Externí odkaz:
http://arxiv.org/abs/2106.12269
Autor:
Bessiere, Christian, Carbonnel, Clement, Dries, Anton, Hebrard, Emmanuel, Katsirelos, George, Lazaar, Nadjib, Narodytska, Nina, Quimper, Claude-Guy, Stergiou, Kostas, Tsouros, Dimosthenis C., Walsh, Toby
Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the user partial queries. That is, we ask the user to classify assignments t
Externí odkaz:
http://arxiv.org/abs/2003.06649
Autor:
Bessiere, Christian, Carbonnel, Clément, Dries, Anton, Hebrard, Emmanuel, Katsirelos, George, Lazaar, Nadjib, Narodytska, Nina, Quimper, Claude-Guy, Stergiou, Kostas, Tsouros, Dimosthenis C., Walsh, Toby
Publikováno v:
In Artificial Intelligence June 2023 319
Autor:
Katsirelos, George
The constraint satisfaction problem is an NP-complete problem that provides a convenient framework for expressing many computationally hard problems. In addition, domain knowledge can be efficiently integrated into CSPs, providing a potentially expon
Externí odkaz:
http://hdl.handle.net/1807/16737
Publikováno v:
Journal Of Artificial Intelligence Research, Volume 40, pages 657-676, 2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a search procedure ("branch and prune") and used at every node of the search
Externí odkaz:
http://arxiv.org/abs/1401.3887
We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong
Externí odkaz:
http://arxiv.org/abs/1207.1811
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-ha
Externí odkaz:
http://arxiv.org/abs/1105.5667
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of two new greedy manipulation algorithms based on intuitions from the b
Externí odkaz:
http://arxiv.org/abs/1007.5104