Crowdly
Add to Chrome
Artificial Intelligence Methods (COMP2001 UNUK SPR) (COMP2011 UNUK SPR) (25-26)
Looking for Artificial Intelligence Methods (COMP2001 UNUK SPR) (COMP2011 UNUK SPR) (25-26) test answers and solutions? Browse our comprehensive collection of verified answers for Artificial Intelligence Methods (COMP2001 UNUK SPR) (COMP2011 UNUK SPR) (25-26) at moodle.nottingham.ac.uk.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Implementing a solver for the sports scheduling problem domain wouldn't require much effort using the HyFlex framework, considering that there are many selection hyper-heuristics already implemented compatible with the HyFlex API.
(I.) Execution time of a heuristic
(II.) The number of times that a heuristic improves the incumbent solution
(III.) The amount of improvement that a heuristic leads to over the time
(IV.) The number of times that a heuristic improves over the best solution found so far
Which of the above metrics could potentially be used to score heuristics in a choice function-based hyper-heuristic?
(I.) HeuristicType.MUTATION
(II.) HeuristicType.LOCAL_SEARCH(III.) HeuristicType.RUIN_RECREATE(IV.) HeuristicType.CROSSOVER(V.) HeuristicType.CONSTRUCTIVE(VI.) HeuristicType.PERTURBATIVE
Which of the above heuristic types are supported by the HyFlex framework?
Which algorithmic components listed below should be designed if Genetic Programming algorithm will be used for solving a given problem?
Tick all that applies.
Which one of the following is the best method to cope with division by zero in a program being evolved by a genetic programming approach?
Which of the following statements about Genetic Programming (GP) are true?
The Largest Degree first graph colouring heuristic can obtain the optimal colouring for any given graph.
What is the minimum number of colours that can be used to colour the vertices of the following strongly connected graph such that no two adjacent vertices share the same colour?
The following table provides Formula 1 scores of the top nine hyper-heuristics among CHeSC finalists and Robinhood hyper-heuristic (RHH) across six problem domains, where TOT denotes the total score.
Which of the following conclusion(s) below can be driven based on this table?
Assume that you have applied a hyper-heuristic for 50 trials, managing a set of 9 low-level heuristics from LLH1 to LLH9, to a set of Vehicle Routing Problem instances denoted as VRP and obtained the following PieChart reporting the share of improvements produced by each low-level heuristic overall.
Is the following statement TRUE or FALSE?
LLH9 generates the lowest number of improvements overall.