Login
Remember
Register
User DavidAnderson
Wall
Recent activity
All questions
All answers
Ask a Question
Questions by DavidAnderson
0
votes
1
answer
A heuristic is a way of trying ___________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
A* algorithm is based on ___________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
The search strategy the uses a problem specific knowledge is known as ___________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
Uninformed search strategies are better than informed search strategies.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
Best-First search can be implemented using the following data structure.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
Heuristic function h(n) is ________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
Greedy search strategy chooses the node for expansion in ___________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
What is the evaluation function in greedy approach?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
What is the space complexity of Greedy search?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
What is the evaluation function in A* approach?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
In many problems the path to goal is irrelevant, this class of problems can be solved using ____________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
Though local search algorithms are not systematic, key advantages would include __________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
When will Hill-Climbing algorithm terminate?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
What are the main cons of hill-climbing search?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
Hill-Climbing approach stuck for which of the following reasons?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
___________ algorithm keeps track of k states rather than just one.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
What are the two main features of Genetic Algorithm?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
0
votes
1
answer
Which of the Following problems can be modeled as CSP?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
What among the following constitutes to the incremental formulation of CSP?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
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.
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
Consider a problem of preparing a schedule for a class of student. What type of problem is this?
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
+1
vote
1
answer
Constraint satisfaction problems on finite domains are typically solved using a form of ___________
asked
Nov 1, 2021
in
Artificial Intelligence
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
Page:
« prev
1
...
90
91
92
93
94
95
96
97
98
99
100
...
123
next »
...
