Maher Helaoui

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper addresses combinatorial problems that can be expressed as Valued Constraint Satisfaction Problems (VCSPs). In the VCSP framework, the constraints are defined by valuation functions to reflect several constraint violation levels. Despite the NP-hardness of VCSPs, tractable versions can be obtained by forcing the allowable valuation functions to(More)
  • 1