Sciweavers

2042 search results - page 99 / 409
» Variable Number of
Sort
View
CP
2005
Springer
15 years 9 months ago
Breaking All Value Symmetries in Surjection Problems
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 ...
Jean-Francois Puget
COR
2011
14 years 11 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
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...
Jennifer Pryor, John W. Chinneck
IJCAI
1989
15 years 5 months ago
A Probabilistic Approach to Marker Propagation
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...
Dekai Wu
FOCS
2008
IEEE
15 years 5 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
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...
Siu On Chan, Michael Molloy
122
Voted
AUTOMATICA
2006
63views more  AUTOMATICA 2006»
15 years 4 months ago
Inference of disjoint linear and nonlinear sub-domains of a nonlinear mapping
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...