Time and space tradeoffs in search, Basic Computer Science

Time and Space Tradeoffs in search-artificial intelligence:

In practice, you need to stop your agent at some stage if it has not searched a solution by then. However, if we can choose the fastest search method, then this will explore more of the search space and increase the likelihood of finding a solution. However, there is a problem with this; It can be that the fastest method is the one which utilize most memory. To perform a search, an agent needs at least to know where it is in a search space, but lots of other things may also be recorded. For instance, a search strategy can involve going over previous ground, and it would save time if the agent knew it had already tried a particular path. Even though RAM capacities in computers are going steadily up, for some of the searches that Artificial Intelligence agents are employed to undertake, they frequently run out of memory. Thus, as in computer science in general, Artificial Intelligence practitioners often have to devise smart  ways to trade memory and time in order to gain  an effective balance.

 

 

Posted Date: 10/2/2012 2:04:02 AM | Location : United States







Related Discussions:- Time and space tradeoffs in search, Assignment Help, Ask Question on Time and space tradeoffs in search, Get Answer, Expert's Help, Time and space tradeoffs in search Discussions

Write discussion on Time and space tradeoffs in search
Your posts are moderated
Related Questions
Question 1 Write short note on                             1) NFS 2) CIFS Question 2 What is Virtual Application? Write down the benefits and drawbacks of it Questi

what is multiplaxer and truth table, digram

Our instructor gave us a project in making a mechanical game or simple device using assembly language, can anyone give me a an example of a project description for our proposal?

QUESTION (a) Define four special target names use with the TARGET attribute (b) Explain the main difference between an HTML and an XHTML page (c) Give two merits and two

Question 1 Explain the various tools used for open source software development Question 2 Discuss the OSS licensing strategies Question 3 Explain the software developmen

The easiest way to approach pipelining is to regard as the three stage fetch, decode and execute instruction execution cycle outlined earlier. There are times during each of these

types of computer on the basis of shape, size & resources

Online Searching: The real difference between manual searching and online searching lies, according to William A. Katz, in the mechanics and the jargon of the latter. However,

how to use computer and how we can manage it

Twisted Pairs: Twisted pairs are familiar to all of us as the copper wire telephone lines. These are of low frequency, and support a limited bandwidth (one voice channel) but