Menu

Question Discussion & Solution

MCQ
Q.
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
forum Discussion
MCQ
2.
The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
forum Discussion
MCQ
3.
What are the main cons of hill-climbing search?
forum Discussion
MCQ
4.
What is the evaluation function in greedy approach?
forum Discussion
MCQ
5.
Which of the Following problems can be modeled as CSP?
forum Discussion

category More Artificial Intelligence Topics

article

Basic Artificial Intelligence

format_list_bulleted 116 MCQs
article

Intelligent Agents

format_list_bulleted 55 MCQs
article

Problem Solving

format_list_bulleted 96 MCQs
article

Logical Agents

format_list_bulleted 49 MCQs
article

Adversarial Search

format_list_bulleted 32 MCQs
article

Fuzzy Logic

format_list_bulleted 14 MCQs
article

Knowledge and Reasoning

format_list_bulleted 87 MCQs
article

Expert Systems

format_list_bulleted 10 MCQs
article

Robotics

format_list_bulleted 22 MCQs
article

Inductive Logic Programming

format_list_bulleted 15 MCQs
article

LISP Programming

format_list_bulleted 42 MCQs
article

Communicating, Perceiving and Acting

format_list_bulleted 68 MCQs
article

Introduction

format_list_bulleted 0 MCQs