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...
296
Brandon Corfman
bcorfman
Dec 11, 2003 10:24 am
A bidirectional algorithm IMO would _have_ to be better because the branching factor is cut down significantly. The only drawback I can see is that Google's...
297
yougooh2000
Dec 12, 2003 5:51 am
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"...
298
E etech058
etech058@...
Dec 12, 2003 8:28 am
Hello, Which language will you use for implementation? Best regards/chenyu ... From: yougooh2000 [mailto:hugo.ferreira@...] Sent:...
299
yougooh2000
Dec 12, 2003 9:47 am
Hi, First versions will (hopefully) be in Prolog. This is for research purposes. Regards, Hugo. ... AIMA's ... (not ... operator's ... that ... the ... ...
300
Imanpreet Singh Arora
imanpreet_arora
Dec 16, 2003 3:51 am
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 ...
301
Imanpreet Singh Arora
imanpreet_arora
Dec 16, 2003 3:51 am
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...
302
amr
amr_ashraf_xp
Dec 16, 2003 4:29 am
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...
303
E etech058
etech058@...
Dec 18, 2003 7:49 am
Hello, I have read the pecudo code again give you my thinking here. If you delete the step 2) (start < s-add < finish), the following problem will happens, To...
304
E etech058
etech058@...
Dec 18, 2003 7:49 am
Hi, I have used AIMA version 1, do you use version 1 or not? I haven't found the inequality of "c(n,a,n') <= h(n) + h(n')" in page 99. In addition, the...
305
yougooh2000
Dec 19, 2003 6:24 am
Hi Chenyu, Thanks for the feedback. Unfortunatelly I could not understand much of your example. I cannot read the characters 8-(. As far as linearization goes,...
306
Imanpreet Singh Arora
imanpreet_arora
Dec 19, 2003 6:29 am
... page 99. ... represent it more clearly. ... Thanks, I am using version 2.0. Moreover on page 99 you won't find the given inequality but the following h(n)...
307
aima-talk@yahoogroups...
Dec 19, 2003 8:55 am
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,...
