Essays about: "Parallel portföljsökning"
Found 1 essay containing the words Parallel portföljsökning.
-
1. Parallel Portfolio Search for Gecode
University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)Abstract : 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. READ MORE
Result pages:
1