Constraint satisfaction problems (CSPs) provide a versatile framework for modelling complex decision-making tasks where a collection of variables must be allocated values that satisfy specific ...

If you’ve ever completed a sudoku puzzle, then you’ve completed a constraint satisfaction problem (CSP). This type of problem is defined as a mathematical question where a number of constraints or ...

We investigate risk-averse stochastic optimization problems with a risk-shaping constraint in the form of a stochastic-order relation. Both univariate and multivariate orders are considered. We extend ...

Over the years, Electronic Design Automation (EDA) tools have matured considerably. They now aid in design and verification of all aspects of chip manufacturing. One area that has lagged behind is the ...

As today’s designs become more complex, so too do their constraints. Design functionality typically gets a lot of attention – through code review, functional verification, etc. However, the ...

Bayardo Jr., R. J.; Schrag, R. C. Using CSP look-back techniques to solve real world SAT instances. In: Proc. of the 14th National Conf. on Artificial Intelligence ...