In the first edition of the Sent from Mount Zion College of Engineering and Technology, Lena Vilaku,Pilivalam PO, Pudukkottai, Tamil Nadu, India. Pin - 622...
In your book AIMA you have defined four approches to AI. How do you classify ANN into one of them and what would be the reasons? Thank you, Bhanu128 Do you...
Hi Can you connect me to someone who can help me with "Logical Agents" Thank you John Wesley Sent from Mount Zion College of Engineering and Technology, Lena...
Hi I had a couple of doubts while going through Ch. 15 (Probabilistic Reasoning over Time) - How do we represent an HMM as a recursive relational probabilistic...
Hello everyone, I have faced an schedule problem. In the specified problem, there are a lot of constraints requirements; in addition, it is requirement for fee...
I just started learning lisp. For the intelligent program acting in the vacuum world, I tried to define several agents, but compiler gives me syntax error. The...
Hi all, I have a simple AI quesiton. On page 73 we read: "...breadth-first search is optimal if the path cost is nondecreasing function of the depth of the...
Hello, we want to create an expert system for disease diagnisis, and we must use Prolog; is there any one to give us the point where we should start! and how...
Hi all, Having a graph, is there only one way how to build a tree using depth first search algorithm? If there is not, because of cycles, is there a way how...
I'm taking a graduate course in AI at NYU and am delighted to find the java demos online. Much thanks to Ravi. I've downloaded them and have walked through...
Hi, I am trying to run the C++ version of the aima codes. However, I got some errors when I compiled the lib/ files.. simple here is what I did and what error...
AIMA 2nd edition page 744 claims "In fact, with a single, sufficiently large hidden layer, it is possible to represent any continuous function of the inputs...
I have a couple questions about Figure 4.8, which shows the search cost of the A* algorithm for the Eight-Puzzle problem. First, what is search cost? In the...
Hello everyone, I have downloaded AIMA version 2 sample chapter 5 and am doing its exercises. In exercise 5.7, it requires to compare the algorithms of MRV, ...
Hello, Friend has recommended a new IT related website. I have browsed it and found it contains many useful url links. Of course, it contains AI related web...
Hello, I have tried to do exercise of chapter 8 and found it is more difficult than previous chapters. I have listed my answer and my consideration about one...
The following aima-talk poll is now closed. Here are the final results: POLL QUESTION: Do you learn AI by yourself for self- interest, No classmate, No...
Hi everybody; I'm asking if there is any one who can help be in solving Exercise 3.4 page 89 in our text book. please if there is anybody who have the...
Hi, I am attempting to implement the POP planner as is described in AIMA's 1st version (Chap. 11.). I am having doubts regarding the call "choose-operator"...
Hi I am reading Russell and Norvig's AIMA and I have the following query. I am reading section 4.1 regarding A* algorithm, I was wondering if the triangular...
Enter your vote today! A new poll has been created for the aima-talk group: Do you learn AI by yourself for self- interest, No classmate, No Professor? o Yes,...
Hello Every body i am student in faculty of computer and informatics cairo university , can any one help to make the puzzle program by clips if any one can...
The algorithm for the simulated annealing algorithm sets the probablilty to e ^ ( delta(E) / T) it should be e ^ ( - delta(E) / T ) -- Imanpreet Singh Arora ...
hello, 1. I am doing exercise 8.3. It is as follows: Encode the description of the 4-bit adder in figure 8.10 and pose the queries to verify that it is in fact...
Hello, I am studying "/search/domains/tsp.lisp" source code, which is about "Travelling salesperson Problem". In the source code, there is a requirement to the...
