... Maybe our sources are different. AFAIK a contradiction is the negation of a tautology (P. Tidman and H. Kahane, Logic and Philosophy: A Modern ...
550
akki582
Sep 25, 2005 3:59 am
Hi, could anyone plz let me know the link to the answers of the exercise of this book...
551
akki malhotra
akki582
Sep 25, 2005 4:00 am
hi, cud anyone plz tell me d link to the answers of d exercises of this book ... Yahoo! for Good Click here to donate to the Hurricane Katrina relief effort....
552
lwudong
Sep 26, 2005 3:46 pm
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....
553
mohammad assarian
assarian_m
Sep 27, 2005 3:50 am
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...
554
The Geek
guihergeek61
Sep 27, 2005 3:52 am
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 ...
555
The Geek
guihergeek61
Sep 27, 2005 3:52 pm
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...
556
savastinuk
ssavasti
Sep 27, 2005 3:52 pm
This makes sense. : ) Can you also explain consistent? Or, better yet, INconsistent? Still talking A*. thanks.... Susan _____ From: aima-talk@yahoogroups.com...
557
savastinuk
ssavasti
Sep 27, 2005 4:00 pm
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...
558
mohammad assarian
assarian_m
Sep 27, 2005 8:33 pm
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...
559
The Geek
guihergeek61
Sep 28, 2005 2:09 am
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...
560
savastinuk
ssavasti
Sep 28, 2005 8:29 am
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 ...
561
shivam shukla
shirohin
Sep 28, 2005 8:29 am
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...
562
Robin
get_imaginary
Sep 28, 2005 6:00 pm
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...
563
Paul Hsueh-Min Chang
avat312
Sep 29, 2005 12:58 pm
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...
564
oldatum
Oct 2, 2005 9:52 am
anyone can give me some clues about the up-to-date info about expert system? Seems this topic has been being faded? Thanks in advance....
565
Paolo Amoroso
amoroso_paolo
Oct 3, 2005 4:32 pm
... 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 ...
566
Ivan Villanueva
artificialidea
Oct 7, 2005 5:55 pm
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...
567
Ulit Jaidee
ulitjd
Oct 10, 2005 6:01 am
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...
568
Robert Futrelle
bobfutrelle
Oct 10, 2005 5:22 pm
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...
569
[3!|_/\|_
bilal_hayat_...
Oct 11, 2005 3:54 pm
Does anyone have the implementation of A* search Of Romania Map or some other in prolog or any other reply urgently savastinuk <minnie@...> wrote: ...
570
kmool100
Oct 12, 2005 3:44 pm
How can we know that our solutions are correct or not ?...
571
saad0105050
Oct 12, 2005 4:53 pm
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...
572
Ivan Villanueva
artificialidea
Oct 13, 2005 3:13 pm
... 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...
573
Neil Conway
nconway2
Oct 14, 2005 10:40 am
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...
574
Robert Futrelle
bobfutrelle
Oct 14, 2005 12:50 pm
It all began with Polya's 1921 proof: http://mathworld.wolfram.com/PolyasRandomWalkConstants.html Then follow the link from there "[Pages Linking Here]" which...
575
billy peralta
billyperalta
Oct 15, 2005 5:50 am
hello well, It is highly possible that the genetic programming is the most apropiate technic. Billy Mark* Robert Futrelle <futrelle@...> escribió: ...
576
oldatum
Oct 18, 2005 9:26 am
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...
577
pranjalawasthi@...
pranjalawasthi
Oct 23, 2005 10:43 am
hi, is it true that CRFs require less training data than other discriminative models.If yes what is the reason? Pranjal Awasthi ...
578
Jan-Georg Smaus
jangeorgsmaus
Oct 25, 2005 3:36 pm
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...
