McqMate
| Q. |
Metaheuristics are ?1)non deterministic 2)non approximate 3)not problem specific |
| A. | 1,2,3 |
| B. | 1,2 |
| C. | 1,3 |
| D. | 2,3 |
| Answer» C. 1,3 | |
1.5k
1
Do you find this helpful?
1
View all MCQs in
Soft Computing and Optimization AlgorithmsDiscussion
seshagiri kyathisri
1 year ago
Which one of the following is a disadvantage of Simulated Annealing method?
a.
Provides optimal solutions to a wide range of problems
b.
There are a lot of tuneable parameters in this algorithm
c.
None of the above
d.
Easy to implement and use
a.
Provides optimal solutions to a wide range of problems
b.
There are a lot of tuneable parameters in this algorithm
c.
None of the above
d.
Easy to implement and use
0
Related MCQs
- Metaheuristics doesnot include ?
- In search techniques, as single point based contradicts population based similary deterministic contradicts ___?
- which of the following statements are true regarding ES ? 1)Survival is deterministic 2)first allows the N best children to survive, and replaces the parents with these children. 3)allows the N best children and parents to survive.
- In fuzzy propositions, ---- gives an approximate idea of the number of elements of a subset fulfilling certain conditions
- Applications of ACO are ? 1)shortest path 2)assignment problem 3)set problem
- Which approach is most suited to structured problem with little uncertainity
- All of the follwing are suitable problem for genetic algorithm EXCEPT
- _________cannot easily be transferred from one problem domain to another
- Which of the follwing computing is trial and error problem solver algorithm
- Which approach is most suited to complex problem with significant uncertainty, a need for experimentation, and time compression?
