Hello: Could you tell me what is the difference and similarity between a Neural Network and a Method Numeric like Euler's Algorithm? I think both have a...
Hello, I'm a high school student from Australia. I just got AIAMA from a uni library, and must say that so far it has been an excellent read. However, I would...
hi everyone, 1. According to the guide, it is necessary to build a binary-tree for representing the "state". The tree's leaves are "1" or "n" and internal...
Hi everyone, I want to discuss the relationship between (DB or dataming) and AI. In my everyone work, I write the enterprise's application using database. DB...
Question 8.2 asks "Consider a knowledge base containing just two sentences: P(a) and P (b). Does this knowledge base entail For All x P(x)? Explain in terms of...
Does anyone know how to compute for the posterior probability of H given this bayesian net? what if I added more variables pointing to H? A--> <--B H C--> ...
anyone has idea what's the point for the line (whose minimax value is already known) included in the question b. If the minimax value is already known, why we...
Hi there everyone I am new to AI, just starting a new couse. what is the definition of admissible?? is admissible an algorithem? is the definition of it "never...
On page 418 in the second edition of the book it is said "each of the actions in the assembly of C1 have a 10-minute window in which they can be started" This...
hi all : i just download the java code from the respository, and then i try out the CSP search program, but i find out that the things weird, the ac-3...
hi. I'm a student at the University of Texas Arlington and I'm trying to implement first order logic without quantifiers in C/C++ .... any tips.. pls email to...
I think Exercise 6.8 is unclear in describing what it is asking the student to do. I think my problem is that I'm having trouble visualizing the game tree....
I would like to what is the Difference of Greedy Best 1st Search and A* Search? In my knowledge, Greedy is using f(n) = h(n), where h(n) is the heuristic...
I was working on problem 3.4 (never did get very good at those sliding-block puzzles as a kid). I found the Berlekamp books at the library, but I haven't...
trying to answer question 3.15 part a of 2002 print am i right to assume its the formula we are after? if so any clues to which pages to look at and paths to...
Hi.I am a student from METU (Middle East Technical University) which is located in Ankara,Turkey(uhh,it`s really away from US:) ).This semester I will be...
The graph-search and tree-search algorithms in chapter 3 of the 2nd edition use a "fringe" variable to maintain the queue of nodes. Does anyone know why the...
Hi all, Can anybody explain me the differences between intelligent agents and rational agents?.If they are different,mail me the details arrividervis gobinath...
Hello, I have the italian version of this great book, but unfortunately there are not the solutions to the excercises, so if someone knows where i can find...
not after the answer, trying to understand the question given (x, y) number of states would be x * y but qn b paths to goal ????? my maths not that strong to...
Hi, I'm ordering a copy of AIMA, and I have the possibility of getting the "International Edition." It seems a little more recent and wallet-friendly. Does...
When I try to access aima.cs.berkeley.edu with Mozilla 1.4, I get a dialog popping up asking me for a name and password for Kerberos authentication. IE doesn't...
