List some properties of SMA* search.

List some properties of SMA* search. 
by

1 Answer

Answer :

* It will utilize whatever memory is made available to it.

 * It avoids repeated states as for as its memory allow.

 * It is complete if the available memory is sufficient to store the shallowest path.

 * It is optimal if enough memory is available to store the shallowest optimal solution path.

Otherwise it returns the best solution that can be reached with the available memory.

 *When enough memory is available for entire search tree, the search is optimally efficient.

 *Hill climbing.

 *Simulated annealing.
by

Related questions

Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Description : Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Last Answer : d) Both RBFS & SMA*

What is SMA* search?

Description : What is SMA* search?

Last Answer : SMA* expands the best leaf until memory is full and it drops the oldest worst leaf node and expands the newest best leaf node.

Write SMA properties ?

Description : Write SMA properties ?

Last Answer : SMA Features: Provides five multiple access return channels and one multiple access forward channel per spacecraft. Includes return service , which uses the same frequency (i.e. 226.5 MHz) and CDMA to avoid ... Services as well as SD-Band Single Access (SSA) and Ku-Band Single Access ( KUSA) .

List the properties of environments.

Description : List the properties of environments.

Last Answer : o Fully Observable Vs Partially Observable o Deterministic Vs Stochastic o Episodic Vs Sequential o Static Vs Dynamic o Discrete Vs Continuous o Single Agent Vs Multi agent  a. Competitive Multi agent  b.Co – operative Multi agent

List the various informed search strategy.

Description : List the various informed search strategy.

Last Answer : Best first search –greedy search ,A* search Memory bounded search-Iterative deepening A*search -simplified memory bounded A*search -Iterative improvement search –hill climbing -simulated annealing 

List the various search strategies.

Description : List the various search strategies.

Last Answer : a. BFS b. Uniform cost search c. DFS d. Depth limited search e. Iterative deepening search f. Bidirectional search

List the performance measures of search strategies.

Description : List the performance measures of search strategies.

Last Answer : i. Completeness ii. Optimality iii. Time complexity iv. Space complexity

What is S-Band Multiple Access (SMA) ?

Description : What is S-Band Multiple Access (SMA) ?

Last Answer : S-Band Multiple Access (SMA) is a technology used by the Tracking and Data Relay Satellite System (TDSS) to provide S-band services. TDRSS provides S-band service through SMA phased arrays. ... gain antenna beams at ground terminals. Material subsets are used to transmit TDRS forward links to users.

Q. 13. What is the value of \( 8 \times 1769 \times 125 \) :(a) 1769000(b) 17680007. The sma(c) 1768010(d) 17690108. Whole

Description : Q. 13. What is the value of \( 8 \times 1769 \times 125 \) :(a) 1769000(b) 17680007. The sma(c) 1768010(d) 17690108. Whole

Last Answer : Q. 13. What is the value of \( 8 \times 1769 \times 125 \) : (a) 1769000 (b) 1768000 7. The sma (c) 1768010 (d) 1769010 8. Whole

A convex surface of radiys of curvature 20 cm separates air from glass of refractive index 1.5. Find the position and the nature of the image of a sma

Description : A convex surface of radiys of curvature 20 cm separates air from glass of refractive index 1.5. Find the position and the nature of the image of a sma

Last Answer : A convex surface of radiys of curvature 20 cm separates air from glass of refractive index 1.5. Find ... at 50 cm in front of the convex surface.

What race is sma most common in?

Description : What race is sma most common in?

Last Answer : Feel Free to Answer

What connector is popular in attaching test instruments like oscilloscopes, frequency counters, spectrum analyzers, etc? A. UHF connector B. PL-259 C. BNC D. SMA

Description : What connector is popular in attaching test instruments like oscilloscopes, frequency counters, spectrum analyzers, etc? A. UHF connector B. PL-259 C. BNC D. SMA

Last Answer : C. BNC

Which of the following is a type of fiber connector: a. ST b. SC c. SMA d. all of the above

Description : Which of the following is a type of fiber connector: a. ST b. SC c. SMA d. all of the above

Last Answer : d. all of the above

What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints

Description : What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints

Last Answer : b) Lack in expressing some of the properties

What is called as the properties of the signal that extend over interval? a) Hops b) Rate c) Frames d) All of the mentioned

Description : What is called as the properties of the signal that extend over interval? a) Hops b) Rate c) Frames d) All of the mentioned

Last Answer : c) Frames

With an example, show objects, properties functions and relations.

Description : With an example, show objects, properties functions and relations.

Last Answer : Example  “EVIL KING JOHN BROTHER OF RICHARD RULED ENGLAND IN 1200” Objects : John, Richard, England, 1200 Relation : Ruled Properties : Evil, King Functions : BROTHER OF

Machine can perform any task better than human with cognitive properties is known as ___ AI. A. Narrow AI B. General AI C. Super AI D. None of above

Description : Machine can perform any task better than human with cognitive properties is known as ___ AI. A. Narrow AI B. General AI C. Super AI D. None of above

Last Answer : C. Super AI 

In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Last Answer : a) Search & Logic

To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Last Answer : d) Planning Graphs

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Description : Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Last Answer : b) Least commitment

Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Last Answer : c) Problem decomposition

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

Inheritance Search a) True b) False

Description : Inheritance Search a) True b) False

Last Answer : a) True

Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Description : Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Last Answer : d) Original statement

A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Description : A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Last Answer : a) Deductive Systems

What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Description : What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Last Answer : b) Hash table of previously seen positions

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Last Answer : a) Regression planning

What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Description : What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Last Answer : c) Relevant actions

How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : d) 4

What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Last Answer : a) Progression planning

How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : b) 2

What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Description : What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Last Answer : d) Both Preconditions & Effects

Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Description :  The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Last Answer : b) Game Tree

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

Adversarial search problems uses ____________ a) Competitive Environment b) Cooperative Environment c) Neither Competitive nor Cooperative Environment d) Only Competitive and Cooperative Environment

Description : Adversarial search problems uses ____________ a) Competitive Environment b) Cooperative Environment c) Neither Competitive nor Cooperative Environment d) Only Competitive and Cooperative Environment

Last Answer : a) Competitive Environment

Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Description : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Last Answer : b) Depth-first search algorithm

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Last Answer : d) All of the mentioned

Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

Description : Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

Last Answer : c) CSP