The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...