We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Potentially, the advantages of marker-passing over local connectionist techniques for associa tive inference are (1) the ability to differen tiate variable bindings, and (2) r...
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
This paper investigates new ways of inferring nonlinear dependence from measured data. The existence of unique linear and nonlinear sub-spaces which are structural invariants of g...
Douglas J. Leith, William E. Leithead, Roderick Mu...