Sökning: "constraint-directed search"
Hittade 1 avhandling innehållade orden constraint-directed search.
1. Set Constraints for Local Search
Sammanfattning : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. LÄS MER
Resultatsidor:
1