Sökning: "Constraint saisfaction"
Hittade 1 avhandling innehållade orden Constraint saisfaction.
1. Function Variables for Constraint Programming
Sammanfattning : Quite often modelers with constraint programming (CP) use the same modelling patterns for different problems, possibly from different domains. This results in recurring idioms in constraint programs. Our approach can be seen as a three-step approach. First, we identify some of these recurring patterns in constraint programs. LÄS MER
Resultatsidor:
1