Industrial optimization applications must be "robust," i.e., must provide good solutions to problem instances of different size and numerical characteristics, and continue to work well when side constraints ...
详细信息
Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. the generalization lifts, in a uniform way, the concept of ref...
详细信息
the order in which the variables are assigned can have an enormous impact on the time taken by a backtracking search algorithm to solve a constraint satisfaction problem (CSP). the Brélaz heuristic is a dynamic v...
详细信息
A method for finding bugs in object-oriented code is presented. It is capable of checking complex user-defined structural properties - that is, of the configuration of objects on the heap - and generates counterexampl...
详细信息
暂无评论