Sökning: "Parallel portfolio search"
Hittade 1 uppsats innehållade orden Parallel portfolio search.
1. Parallel Portfolio Search for Gecode
Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)Sammanfattning : Constraint programming is used to solve hard combinatorial problems in a variety of domains, such as scheduling, networks and bioinformatics. Search for solving these problems in constraint programming is brittle and even slight variations in the problem data or search heuristic used can dramatically affect the runtime. LÄS MER
Resultatsidor:
1