no code implementations • 13 Sep 2021 • Dimosthenis C. Tsouros, Kostas Stergiou
Experiments from various domains demonstrate that our resulting algorithm that integrates all the new techniques does not only generate considerably fewer queries than QuAcq and MultiAcq, but it is also by far faster than both of them, in average query generation time as well as in total run time, and also largely alleviates the premature convergence problem.
no code implementations • 14 Mar 2020 • Christian Bessiere, Clement Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh
Learning constraint networks is known to require a number of membership queries exponential in the number of variables.
no code implementations • 15 May 2017 • Minas Dasygenis, Kostas Stergiou
This is because applying such consistencies can sometimes result in considerably smaller search tree sizes and therefore in important speed-ups, but in other cases the search space reduction may be small, causing severe run time penalties.
