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
Acting Rationally: Al Capone was finally convicted for tax evasion. Were the police acting rationally? To answer this, we must first look at how the performance of police force

The cost of building and maintaining an organizational computing ecosystem has become a bigger part of most organizations’ budgets. Organizations have been looking for ways to redu


requirement analysis and specification for online voting

Which applications require TCP and why? Also specify which applications require UDP and why? A4) TCP is also known as connection-oriented: setup required between client and server

Consider a CPU that implements two parallel fetch-execute pipelines for superscalar processing. Show the performance improvement over scalar pipeline processing and no-pipeline pro

Open Systems Interconnection (OS1): As there are many different protocols for LANs and WANs, communication between two different systems can be difficult. The International St

function to delete a telephone book record in c programing using struct and objects...?

To make a program in assembler two choices exist, the earliest one is to use the TASM or Turbo Assembler, of Borland, and the next one is to use the debugger, generally we use this

I need to create mulitple queues assignment that run concurrently. It is like a queue simulation with  number of checkouts with a random probability of clients, joining any one