109 search results - page 14 / 22 » Variable symmetry breaking in numerical constraint problems |
EOR
2008
14 years 10 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
109
click to vote
AAAI
1994
14 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
159
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
AMSTERDAM
2009
14 years 7 months ago
2009
The paper provides a compositional account of cumulative readings with non-increasing modified numerals (aka van Benthem's puzzle), e.g., Exactly three boys saw exactly five m...