Zobrazeno 1 - 10
of 104
pro vyhledávání: '"Stergiou, Kostas"'
Autor:
Ploskas, Nikolaos, Stergiou, Kostas
The p-median problem concerns the location of facilities so that the sum of distances between the demand points and their nearest facility is minimized. We study a variant of this classic location problem where minimum distance constraints exist both
Externí odkaz:
http://arxiv.org/abs/2207.05590
Publikováno v:
Constraints 25.3 (2020): 180-225
Constraint acquisition systems such as QuAcq and MultiAcq can assist non-expert users to model their problems as constraint networks by classifying (partial) examples as positive or negative. For each negative example, the former focuses on one const
Externí odkaz:
http://arxiv.org/abs/2109.05920
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
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dasygenis, Minas, Stergiou, Kostas
Local consistencies stronger than arc consistency have received a lot of attention since the early days of CSP research. %because of the strong pruning they can achieve. However, they have not been widely adopted by CSP solvers. This is because apply
Externí odkaz:
http://arxiv.org/abs/1705.05316
The search strategy of a CP solver is determined by the variable and value ordering heuristics it employs and by the branching scheme it follows. Although the effects of variable and value ordering heuristics on search effort have been widely studied
Externí odkaz:
http://arxiv.org/abs/1009.0407
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRRC algorithms suffer from overheads and redundancies as they can repeate
Externí odkaz:
http://arxiv.org/abs/1008.5189
Autor:
Balafoutis, Thanasis, Stergiou, Kostas
Publikováno v:
In Proceedings of the 19th European Conference on Artificial Intelligence - ECAI 2010
The two standard branching schemes for CSPs are d-way and 2-way branching. Although it has been shown that in theory the latter can be exponentially more effective than the former, there is a lack of empirical evidence showing such differences. To in
Externí odkaz:
http://arxiv.org/abs/1008.0660