Search the web
Sign In
New User? Sign Up
aima-talk · AI: A Modern Approach: Help for the text
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Message search is now enhanced, find messages faster. Take it for a spin.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
Messages 206 - 235 of 867   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
206
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...
palookabutt
Offline Send Email
Sep 3, 2003
4:54 pm
207
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...
Brandon Corfman
bcorfman
Offline Send Email
Sep 5, 2003
5:56 pm
208
The collection of nodes is a queue of nodes that are on the fringe of the graph -- fringe meaning the frontier, or the leaf nodes of the expanding graph. We...
Peter Norvig
norvig
Offline Send Email
Sep 5, 2003
9:22 pm
209
Hi all, Can anybody explain me the differences between intelligent agents and rational agents?.If they are different,mail me the details arrividervis gobinath...
gobinath_kvp
Offline Send Email
Sep 7, 2003
4:56 pm
210
Hi Gobinath, The computer hasn’t emotion like human. It can’t write some very beautiful song, like human. If computer do something, it will “do the right...
Ulit Jaidee
ulitjd
Offline Send Email
Sep 8, 2003
9:54 am
211
... Quite right about emotions. Now: I just wonder then, when a computer does the right thing and a human considers it also the right thing to do, then the...
vlopez2010
Offline Send Email
Sep 8, 2003
1:05 pm
212
i just wanted to let everyone know ive finally settled down. she's so damn hott. you wouldnt believe her breasts. ...
kaylasrevenge222
kaylasreveng...
Offline Send Email
Sep 8, 2003
4:14 pm
213
Ah, I thought that fringe might be referring to a specific data structure I hadn't heard of before. Thanks for the explanation. Brandon Peter Norvig wrote: The...
Brandon Corfman
bcorfman
Offline Send Email
Sep 9, 2003
6:53 pm
214
Hello All, Does somebody have or (know where can be found) an exercise map from AIMA 1st to 2nd edition? Thanks....
Giuliano Mendonça
giumendonca
Offline Send Email
Sep 11, 2003
12:41 am
215
Hi all, I am in need of certain guideliness for selecting a heuristic functions to a given problem. bfn gobinath Yahoo! India Matrimony: Find your partner...
Gobinath
gobinath_kvp
Offline Send Email
Sep 11, 2003
7:00 am
216
can anybody suggest some good books or journals on AI for the beginners. Yahoo! India Matrimony: Find your partner online.Post your profile....
vishal miragi
aztecvishu
Offline Send Email
Sep 16, 2003
3:08 am
217
Hi Vishal, U can try the website aaai.org.it's really cool for beginners vishal miragi <aztecvishu@...> wrote: can anybody suggest some good books or...
Gobinath
gobinath_kvp
Offline Send Email
Sep 16, 2003
6:23 am
218
I think part b is designed to help you with part a. Look at the problem again ... you are trying to find the _shortest_ paths to the goal, not all possible...
Brandon Corfman
bcorfman
Offline Send Email
Sep 21, 2003
5:54 am
219
I´m trying to resolve the nqueens problem using simulated annealing search function in java, but i have some trouble with the second parameter in...
experimento_2
Offline Send Email
Sep 21, 2003
5:54 am
220
I was also working on problem 3.4 and decided to look up the Berlekamp books. I only found very brief coverage of the eight-puzzle and nothing particularly...
Simon D'Alfonso
simon_dalfonso
Offline Send Email
Sep 21, 2003
5:55 am
221
Hi everyone, I am totally confused with uniform-cost search method.can anybody explain me that as soon as possible.I also in need of some more explanations for...
Gobinath
gobinath_kvp
Offline Send Email
Sep 25, 2003
5:11 am
222
Do you have an understanding of breadth-first search and depth-first searches? I think you will need to get these down before you will understand the others. ...
Brandon Corfman
bcorfman
Offline Send Email
Sep 26, 2003
4:50 pm
223
never good at 8-puzzle. could anyone help me finding a heuristics which overestimates sometimes. almost totally lost in the field thx...
gobigredhuskers2000
gobigredhusk...
Offline Send Email
Sep 27, 2003
12:05 am
224
The sum of the squares of Manhatan distances. ... From: "gobigredhuskers2000" <gobigredhuskers2000@...> To: <aima-talk@yahoogroups.com> Sent: Friday,...
Giuliano
giumendonca
Offline Send Email
Sep 27, 2003
6:16 pm
225
... Our class has an assignment on this due soon, so I can't give you a specific answer; however, as a hint, consider rules one might apply for finding...
palookabutt
Offline Send Email
Sep 28, 2003
8:33 pm
226
Thanks for the references. You're right, they were much more helpful than Berlekamp. Berlekamp is one of those sets of books which would be fun to get into...
palookabutt
Offline Send Email
Sep 28, 2003
8:33 pm
227
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....
icewind0
Offline Send Email
Oct 4, 2003
7:46 pm
228
... From: "icewind0" <icewind0@...> Sent: October 03, 2003 2:31 PM ... No. It only defines a particular path within the tree. ... An outcome of N rolls...
Serguei Mokhov
stgunya
Offline Send Email
Oct 4, 2003
8:06 pm
229
... A die-roll sequence is 8 rolls (say). There are 50 different sequences. Each one determines a game tree. In each of those trees, there are only moves for...
Peter Norvig
norvig
Offline Send Email
Oct 4, 2003
8:20 pm
230
Hi all, What happens when two Deep Blue Chess Program[Deep Blue A vs. Deep Blue B] compete with each other?.Is this game leads to draw? what are the factors...
Gobinath
gobinath_kvp
Offline Send Email
Oct 5, 2003
10:41 pm
231
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...
soft903
Offline Send Email
Oct 6, 2003
6:35 am
232
I think it will end in a draw. But if it ended in a win it would be more facinating. bhanu Gobinath <gobinath_kvp@...> wrote: Hi all, What happens when...
Maithreebhanu
bhanu128
Offline Send Email
Oct 8, 2003
10:20 am
233
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...
Alex0215
h5641kimo
Offline Send Email
Oct 18, 2003
3:33 am
234
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...
denzrule
Offline Send Email
Oct 18, 2003
3:34 am
235
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...
hkstudentinuk
Offline Send Email
Oct 18, 2003
4:49 pm
Messages 206 - 235 of 867   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help