Interested to Buy Any Domain ? << Click Here >> for more details...
____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.
a) Static CSPs
b) Dynamic CSPs
c) Flexible CSPs
d) None of the above
- 1 Answers
- 3806 Views
- I also Faced
- E-Mail Answers
Post New Answer View All Answers
A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above
What is lisp?
What is fopl stands for and explain its role in artificial intelligence?
What are some of the benefits of using a blue prism for robotics?
What is autonomous robot?
What is hidden markov model (hmms) is used?
How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c
In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) searchable state spaces d) All of the mentioned
Rational agent is the one who always does the right thing. State true or false a) True b) False
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary
What does a hybrid bayesian network contain?
What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b
Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent
___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search
Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b
