Thank you for helping me out. I find BNF and Psedo code used in this book to diificult to grasp at first. Are there any documents on them for us to learn...
267
chenyu468
Dec 1, 2003 5:40 pm
Hi everyone, I have read "vacuum.lisp", "utility.lisp" source code. The function "rotate" in the "utility.lisp" make me puzzle. The purpose of "rotate"...
268
Peter Norvig
norvig
Dec 1, 2003 5:48 pm
The theory is vector arithmetic. If you work out the combinations, it turns out the same as what you would be doing in your enumeration of cases. -Peter...
269
chenyu468
Dec 2, 2003 3:25 am
... this ... them ... The book's writing style may be like this: a simple problem ( provide simple solution -> a complex problem (provided modified solution or...
270
pcomitz
Dec 3, 2003 5:22 pm
Has anyone tried to work the example on pages 713/714 (second edition)? I cannot got equation 20.1 to match the graph on page 714 (figure 20.1(a)). For...
271
chenyu468
Dec 3, 2003 5:50 pm
Hello, I found "/search/domains/vacuum.lisp" source code is a little old. Because in the above "domains" directory, other files are written with a style of...
272
pu_shi2003
Dec 4, 2003 6:43 am
Hello everyone: Now i'm doing the exercise 3.14 on the 1st edition. My professor named it with Google's search? Does google use bidirectional search? I have...
273
pu_shi2003
Dec 4, 2003 6:44 am
Deeply sorry....
274
chenyu468
Dec 4, 2003 6:50 am
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...
275
chenyu468
Dec 5, 2003 7:14 pm
... I have the 1st vesion AIMA. Could you write down the 3.14 here for discussion? kind regards/chenyu...
276
Brandon Corfman
bcorfman
Dec 5, 2003 7:31 pm
Are you asking "why is there a requirement for a complete graph?" or "why is the check-tsp-map function called where it is?" Brandon ... that's,...
277
amoroso_paolo
Dec 5, 2003 7:42 pm
... Which files use classes? As for structures, the rationale for using them is explained in the comments (see section ";; Design Decision Notes") of file...
278
Brandon Corfman
bcorfman
Dec 5, 2003 7:43 pm
Well, here are some thoughts on the subject. -- The branching factor for any particular web page could be very large. You'd probably want to consider a way of...
279
chenyu468
Dec 6, 2003 12:50 am
hello, I am asking "why is there a requirement for a complete graph?" kind regards/chenyu ... every...
280
chenyu468
Dec 6, 2003 12:51 am
... old. ... The modification file is in the office's PC. I will post the modification on 2003/12/8. I have read (section ";; Design Decision Notes") of file...
281
Paulo Coelho Ventura ...
paulocoelhov...
Dec 7, 2003 12:36 am
Once I have looked for an ABSOLVER implementation in the Web. My quest was in vain... If anyone knows how to obtain information obout it and its implementation...
282
chen yu
chenyu468
Dec 8, 2003 1:39 am
Hello Brandon, I have attached the original source code and modified source code. Thank you for your attention. kind regards/chenyu ... old. ... The...
283
Paolo Amoroso
amoroso_paolo
Dec 8, 2003 2:58 am
... Here is the text of exercise 3.14 from the 2nd edition of AIMA: Write a program that will take as input two Web page URLs and find a path of links from one...
284
chenyu468
Dec 8, 2003 7:31 am
Hello, I am reading "search/domains/tsp.lisp" and "route-finding.lisp" files. The author explains that "h-heuristic" function is a relaxed version of a minimum...
285
chenyu468
Dec 8, 2003 7:31 am
... for ... find a ... engine ... By the way, I have 2 stupid pre-questions: 1. Why it is necessary to search a path of links from one URL to the other URL?...
286
Brandon Corfman
bcorfman
Dec 9, 2003 6:03 am
... 1. This is not supposed to be an implementation of a search engine, but I think more of a "six degrees of websites" question. (Apologies to Kevin Bacon!...
287
Brandon Corfman
bcorfman
Dec 9, 2003 6:03 am
A TSP does not require a complete graph, but it becomes more difficult to solve it otherwise**. For instance, a fast but effective algorithm like 2-Opt (that...
288
Paolo Amoroso
amoroso_paolo
Dec 9, 2003 4:24 pm
... [...] ... [...] ... It's a function that, given a node N, returns all nodes that have links to N. Paolo -- Why Lisp?...
289
omar 1
merag2010
Dec 10, 2003 2:44 am
i am new AI Student __________________________________ Do you Yahoo!? New Yahoo! Photos - easier uploading and sharing. http://photos.yahoo.com/...
290
shi pu
pu_shi2003
Dec 10, 2003 2:46 am
Hi,all: Thanks for your discussion. I have (kind of) implemented this problem. I scanned the starting URL,search for the key work "link",expand again and again...
291
chenyu468
Dec 10, 2003 7:05 am
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...
292
chenyu468
Dec 10, 2003 7:06 am
I understand your meaning now. Thank you very much. Best regards/chenyu ... difficult ... algorithm ... path) ... would ... which...
293
Fidelis Temu
fideldor
Dec 10, 2003 7:19 am
Please unsubscribe me from yor database ... Do you Yahoo!? Protect your identity with Yahoo! Mail AddressGuard...
294
Fidelis Temu
fideldor
Dec 10, 2003 8:12 am
Fidelis Temu <fideldor@...> wrote:Please unsubscribe me from yor database ... Do you Yahoo!? Protect your identity with Yahoo! Mail AddressGuard Yahoo!...
295
chenyu468
Dec 10, 2003 8:23 am
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...
