4281 search results - page 789 / 857 » How to Disembed a Program |
CP
2004
Springer
14 years 3 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
CPAIOR
2004
Springer
14 years 3 months ago
2004
Springer
We discuss a di cult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the b...
CSL
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
DFG
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Today's manufacturing industry demands flexible and decentralized production control systems to avoid hours of down time of the production line in case of a failure ...
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...