In page97, line 7: The restriction is to choose an h function that never overestimates the cost to reach the goal. Such an h is called an admissible heuristic....
If we are at node n and my goals are in t1,t2,.... tn. The most aware way from n to Ti shows with H* but we have an estimate of future that we shows with H and...
I think my version is different from yours, but I assume you're talking about the A* search algorithm. The proof is in the book a page or so later, but look ...
I think the discussion all boils down to the definition of "consistent" and "contradiction". I was kind of hoping one of the authors would chime in at some...
This makes sense. : ) Can you also explain consistent? Or, better yet, INconsistent? Still talking A*. thanks.... Susan _____ From: aima-talk@yahoogroups.com...
Hi again, I apologize for interrupting (can you do that in email?!) Before answering me, the person who asked the original question should be satisfied with...
Dear Sir. When the path estimate is too high, this means that your h function has more less aware(h1) than time your path estimate has more accuracy(h2). when...
Consistency of heuristics is a little more tricky to explain, since every consistent one is also admissible. If you're not from the U.S., I'll apologize in...
Rob, Thanks so much! This helps me with a homework problem that I was completely stumped on. I'll cite your letter, as our teacher asked us to do if we get ...
hey everybody am doing a project on image processing n am using the convolution theorem given in chapter 25.in tht am not able to get an image function. it...
The index in my edition (2nd) gives only two mentions of convolution: pg 869 and pg 899. These are in chapter 24, not ch. 25. So I'm not sure what you're...
I doubt if I can make the issues more clear, but I'll try. I still think the main problem lies in the phrase "if it were false". If a proposition in a set is...
... I wondered this myself, and posted some notes to my blog: Expert systems: what happened in the past decade? http://www.paoloamoroso.it/log/050309.html ...
Hello ML, I'm the guy who's doing an alternative implementation of the algorithms in the book in Java. I've done a long break but now I've decided to continue...
Dear everyone: Could anyone please tell me if I would like to do research on Automatic Music Composition Generator, who is the professor in this area and what...
Googling on automated "music composition" ai produced about 12,500 page hits. I think you'll find what you need there, though I realize there may be someone on...
hi there! is there any solution to the excercises of aima? like chapter by chapter? If there is any on the net, plz let it be known, and if anyone has solved...
... If by "any other" you mean any other language, yes there are A* implementations in Lisp, Python and Java on the Aima webpage, and on my homepage in java...
Page 126 of AIMA, 2nd ed, notes that: "It is easy to prove that a random walk will eventually find a goal or complete its exploration, provided that the space...
It all began with Polya's 1921 proof: http://mathworld.wolfram.com/PolyasRandomWalkConstants.html Then follow the link from there "[Pages Linking Here]" which...
Hello all, I met this when I was doing my homework. Prove that, if the heuristic function h never overestimates by more than cost c, A* search using h returns...
Hi everyone, the book explains pattern databases on page 107 (2nd ed.). It says that it is currently unknown how how the pattern database approach can be...
Hello, in 13.4 of the book, there is the formula: P(Y) = Sum over z of: P(Y,z) I have problems to understand this formula and probably I'm not the only one ...
Some quz about search: 1> A* algorithm When I make a program to slove a graph problem, I use graph search so that I must do the thing to cheak if a node has...
Hi all, A couple of people wrote to me saying their Anti Virus software reported that the "learning"; directory of the java code is infected with a worm,...
