Search the web
Sign In
New User? Sign Up
aima-talk · AI: A Modern Approach: Help for the text
  • Members Only
  • Post
  • Polls
  • Members
  • Promote
  • Groups Labs (Beta)
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Hear how Yahoo! Groups has changed the lives of others. Take me there.

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
Message #
Search:
Advanced
Messages 1 - 31 of 868   Newest  |  < Newer  |  Older >  |  Oldest
Messages: Show Message Summaries   (Group by Topic) Sort by Date v  
#31 From: "Rafal Kicinger" <rkicinge@...>
Date: Fri Jan 4, 2002 8:50 pm
Subject: error in the algorithm p.73 		rkicinge
Offline Offline
Send Email Send Email
 
Hi,
I've noticed a small error in the algorithm GENERAL-SEARCH on p.73
In Figure 3.10 there is:
 
nodes <-- QUEUING-FN ...
 
and it should be:
 
else nodes <-- QUEUING-FN ...
 
I hope I'm right with it.
 
Bye,
Rafal

Reply | Forward | Messages in this Topic (2)
#30 From: Becca Wemhoff <wemhoff@...>
Date: Wed Nov 21, 2001 6:53 pm
Subject: error p.525 AIMA 		bmwemhoff
Offline Offline
Send Email Send Email
  
On page 525, end of 5th line of "18.1 A General Model of Learning Agents"
currently reads:
"The learning element takes some knowledge about the learning element ..."

It should read:
"The learning element takes some knowledge about the performance element
..."

in order to match Figure 18.1.

-- Becca Wemhoff

Reply | Forward | Messages in this Topic (1)
#29 From: maddalab@...
Date: Mon Nov 19, 2001 11:30 pm
Subject: Suggestion for General rules given on page 225 And other error in Chapter 7 		maddalab
Online Now Online Now
Send Email Send Email
  
Hi,
I purchased the book recently and think I have the 2nd Printing, so
these errors should be in all books. Please do correct me in case I
am wrong. I have checked on the errata section on the home page of
the book and could not find these there.

I have a suggestion for the general rules given on page 225 for the
electronic circuit domain

Rules 4,5 do not limit the number of input signal on the OR and AND
gates respectively and are general.

However rule 6 limits the number of Input signals on the XOR gate to 2

My suggesion is for the rule to be changed to the following in
keeping with the earlier rules

V g Type(g) = XOR => Signal (Out(1,g))=On <=>
  ThereExists n1,n2 (Signal(In(n1,g)) <> Signal(In(n2,g))) And (n1<>n2)

Errata on Pg 192

Pg 192 Nested Qualifiers
"For all x and for all y, if x is the parent of y then y is the child
of x"

V x, y Parent (x, y) => Child (y, x)

According to the truth table Child (y, x) is true if Parent (x, y) is
true otherwise we do not make a statement about Child (y, x). This
allows the possibility that Child (y, x) be true i.e. "y is the child
of x" without `x' being the parent of `y'


The correct representation should have been

V x, y Parent (x, y) <=> Child (y, x)

OR

V x, y Parent (x, y) And Child (y, x)

I am assuming the standard meaning of the predicates Child and Parent
here

Pg 197

There is a typo here the line in the book states

"Thus, we will are have two unary predicates"

this line is 8 th line from the bottom

Regards
Bhaskar Maddala

Reply | Forward | Messages in this Topic (1)
#28 From: Mariano Buñirigo <mbunirigo@...>
Date: Tue Oct 30, 2001 2:58 pm
Subject: Re: Use of AIMA code to solve 8-puzzle 		mbunirigo
Offline Offline
Send Email Send Email
  
I´ve done this excersice on Sunday

Try this
(solve (make-8-puzzle-problem) 'A*-search)
You are going to receive the resolution of the problem
using A*, h function is by default Manhattan distance.

  --- jan_gilbert_pearce@... escribió:
<HR>
<html><body>
<tt>
Hi There,<BR>
<BR>
I am a student at U Minnesota and I have loaded
Russell's code for the<BR>
8-puzzle.&nbsp; I have the code and the utility
functions loading fine on<BR>
my system, but I cannot figure out how to employ the
solve function. <BR>
Can anyone tell me a line of code that will work to
solve a random<BR>
instance of the 8-puzzle?<BR>
<BR>
Thanks!<BR>
Jan<BR>
  <BR>
<BR>
</tt>


<br>
<tt>
To unsubscribe from this group, send an email to:<BR>
aima-talk-unsubscribe@yahoogroups.com<BR>
<BR>
</tt>
<br>

<br>
<tt>Your use of Yahoo! Groups is subject to the <a
href="http://docs.yahoo.com/info/terms/">Yahoo! Terms
of Service</a>.</tt>
</br>

</body></html>


Conectate a Internet GRATIS con Yahoo! Conexión:
http://conexion.yahoo.com.ar

Reply | Forward | Messages in this Topic (2)
#27 From: bhami3@...
Date: Tue Oct 30, 2001 6:18 am
Subject: Notation 		bhami3
Offline Offline
Send Email Send Email
  
I wish the book had an appendix defining all notation used. Different
chapters use different notations from many branches of mathematics
and logic, and the same symbol may mean different things in different
places. For instance, I'm accustomed to reading a vertical bar
as "or", but I suspect it means something else in the section on
speech understanding.

I am reading parts of the text as a volunteer for Recording for the
Blind and Dyslexic http://www.rfbd.org/, so it's important that I be
able to verbalize the math coherently.

--Bruce

Reply | Forward | Messages in this Topic (1)
#26 From: jan_gilbert_pearce@...
Date: Tue Oct 30, 2001 12:54 am
Subject: Use of AIMA code to solve 8-puzzle 		jan_gilbert_...
Offline Offline
Send Email Send Email
  
Hi There,

I am a student at U Minnesota and I have loaded Russell's code for the
8-puzzle.  I have the code and the utility functions loading fine on
my system, but I cannot figure out how to employ the solve function.
Can anyone tell me a line of code that will work to solve a random
instance of the 8-puzzle?

Thanks!
Jan

Reply | Forward | Messages in this Topic (2)
#25 From: Bhaskar Maddala <maddalab@...>
Date: Sun Oct 28, 2001 10:12 pm
Subject: Re: Re: Question 		maddalab
Online Now Online Now
Send Email Send Email
  
just use the :continue 0 (ignore and rename i think)
on the prompt when you get this error.

  --- reggie@... wrote:
<HR>
<html><body>
<tt>
It turns out that Franz ships Allegro 6.0 Tral version
in non ANSI<BR>
mode with respect to case sensitivity. There is a
readme.txt in the<BR>
distribution directory describing how to build an ANSI
case compliant<BR>
image. From what little I understand, the CD has
several different<BR>
images on it and you should determin which one has the
case set to<BR>
case-insensitive-upper.<BR>
<BR>
In addition in utilities.lisp the macro WHILE is
defined which is<BR>
already defined in Allegro. Also in the macro deletef
get-setf-method<BR>
should be changed to get-setf-expansion.<BR>
<BR>
-Reggie<BR>
<BR>
<BR>
--- In aima-talk@y..., mbunirigo@y... wrote:<BR>
&gt; Hello, I'm a studen at Buenos Aires University,
Argentina<BR>
&gt; <BR>
&gt; I've installed Alegro CL 6.0 to use AIMA
package<BR>
&gt; <BR>
&gt; I have a the following problem: <BR>
&gt; when I tried to load aima.lisp, Alegro CL 6.0
shows me this error<BR>
&gt; <BR>
&gt; Error: Attempt to make a FUNCTION definition for
the name WHILE as a <BR>
&gt; MACRO.&nbsp; This name is in the EXCL package and
redefining it is a <BR>
&gt; violation for portable programs.&nbsp; Replacing
the current definition of <BR>
&gt; #&lt;macro WHILE @ #x200260b2&gt; may be
dangerous.&nbsp; The package EXCL has <BR>
&gt; PACKAGE-DEFINITION-LOCK set, which causes the
system to signal this <BR>
&gt; violation.<BR>
&gt; [condition type: PACKAGE-LOCKED-ERROR]<BR>
&gt; <BR>
&gt; I undestand that Aima package has some functions
that Alegro CL 6.0 <BR>
&gt; have yet defined.<BR>
&gt; <BR>
&gt; Anybody knows how to solve this problem.<BR>
&gt; <BR>
&gt; Thanks in advance, Mariano Buñirigo<BR>
<BR>
</tt>

<br>

<!-- |**|begin egp html banner|**| -->

<table border=0 cellspacing=0 cellpadding=2>
<tr bgcolor=#FFFFCC>
<td align=center><font size="-1"
color=#003399><b>Yahoo! Groups Sponsor</b></font></td>
</tr>
<tr bgcolor=#FFFFFF>
<td align=center width=470><table border=0
cellpadding=0 cellspacing=0><tr><td align=center><font
face=arial size=-2>ADVERTISEMENT</font><br><a
href="http://rd.yahoo.com/M=213858.1650662.3186813.1261774/D=egroupweb/S=1705948\
923:HM/A=763352/R=0/*http://www.classmates.com/index.tf?s=5085"
target=_top><img
src="http://us.a1.yimg.com/us.yimg.com/a/cl/classmates_com2/bll_lrec1.gif"
alt="" width="300" height="250"
border="0"></a></td></tr></table></td>
</tr>
<tr><td><img alt="" width=1 height=1
src="http://us.adserver.yahoo.com/l?M=213858.1650662.3186813.1261774/D=egroupmai\
l/S=1705948923:HM/A=763352/rand=336668514"></td></tr>
</table>

<!-- |**|end egp html banner|**| -->


<br>
<tt>
To unsubscribe from this group, send an email to:<BR>
aima-talk-unsubscribe@yahoogroups.com<BR>
<BR>
</tt>
<br>

<br>
<tt>Your use of Yahoo! Groups is subject to the <a
href="http://docs.yahoo.com/info/terms/">Yahoo! Terms
of Service</a>.</tt>
</br>

</body></html>


___________________________________________________________________
*NEW*   Yahoo! Messenger for SMS. Now on your ORANGE phone    *NEW*
         Visit http://in.mobile.yahoo.com/smsmgr_signin.html

Reply | Forward | Messages in this Topic (5)
#24 From: reggie@...
Date: Sun Oct 28, 2001 12:24 am
Subject: Re: Question 		perryrs
Offline Offline
Send Email Send Email
  
It turns out that Franz ships Allegro 6.0 Tral version in non ANSI
mode with respect to case sensitivity. There is a readme.txt in the
distribution directory describing how to build an ANSI case compliant
image. From what little I understand, the CD has several different
images on it and you should determin which one has the case set to
case-insensitive-upper.

In addition in utilities.lisp the macro WHILE is defined which is
already defined in Allegro. Also in the macro deletef get-setf-method
should be changed to get-setf-expansion.

-Reggie


--- In aima-talk@y..., mbunirigo@y... wrote:
> Hello, I'm a studen at Buenos Aires University, Argentina
>
> I've installed Alegro CL 6.0 to use AIMA package
>
> I have a the following problem:
> when I tried to load aima.lisp, Alegro CL 6.0 shows me this error
>
> Error: Attempt to make a FUNCTION definition for the name WHILE as a
> MACRO.  This name is in the EXCL package and redefining it is a
> violation for portable programs.  Replacing the current definition of
> #<macro WHILE @ #x200260b2> may be dangerous.  The package EXCL has
> PACKAGE-DEFINITION-LOCK set, which causes the system to signal this
> violation.
> [condition type: PACKAGE-LOCKED-ERROR]
>
> I undestand that Aima package has some functions that Alegro CL 6.0
> have yet defined.
>
> Anybody knows how to solve this problem.
>
> Thanks in advance, Mariano Buñirigo

Reply | Forward | Messages in this Topic (5)
#23 From: mbunirigo@...
Date: Fri Oct 26, 2001 12:50 am
Subject: Question 		mbunirigo
Offline Offline
Send Email Send Email
  
Hello, I'm a studen at Buenos Aires University, Argentina

I've installed Alegro CL 6.0 to use AIMA package

I have a the following problem:
when I tried to load aima.lisp, Alegro CL 6.0 shows me this error

Error: Attempt to make a FUNCTION definition for the name WHILE as a
MACRO.  This name is in the EXCL package and redefining it is a
violation for portable programs.  Replacing the current definition of
#<macro WHILE @ #x200260b2> may be dangerous.  The package EXCL has
PACKAGE-DEFINITION-LOCK set, which causes the system to signal this
violation.
[condition type: PACKAGE-LOCKED-ERROR]

I undestand that Aima package has some functions that Alegro CL 6.0
have yet defined.

Anybody knows how to solve this problem.

Thanks in advance, Mariano Buñirigo

Reply | Forward | Messages in this Topic (5)
#22 From: "Brandon Corfman" <bcorfman@...>
Date: Thu Oct 25, 2001 2:37 am
Subject: ANN: EightQueens 		bcorfman
Offline Offline
Send Email Send Email
  
I've posted a C++ solution to problem 3.14 on my web site, under the
Software section:

http://userpages.umbc.edu/~bcorfm1

Regards,
Brandon

Reply | Forward | Messages in this Topic (1)
#21 From: Chiovari Cristian Sergiu <csergiu77@...>
Date: Tue Oct 23, 2001 6:06 pm
Subject: Re: Answers to some problems Chapter 6 		csergiu77
Online Now Online Now
Send Email Send Email
  
thx

__________________________________________________
Do You Yahoo!?
Make a great connection at Yahoo! Personals.
http://personals.yahoo.com

Reply | Forward | Messages in this Topic (1)
#19 From: Bhaskar Maddala <maddalab@...>
Date: Sat Oct 20, 2001 11:01 pm
Subject: Re: help for code ex.2.6 		maddalab
Online Now Online Now
Send Email Send Email
  
i think you could go to the home page of the book. The
authors have a preliminary verion of aima code in
java. the code is currently not runnable but should
provide you an insight on how to implement it in JAVA.

http://www.cs.berkeley.edu/%7Erussell/aima-java/doc/api/Package-aima.agents.html

i have included a link above for agents, hope it is of
help to you


  --- tiowanio@... wrote:
<HR>
<html><body>
<tt>
Hi all,<BR>
I am a beginner to the field of AI, and am currently
using the book<BR>
to get started. I was looking at the problems at the
end of the<BR>
second chapter, some of which ask for the
implementation. Ex 2.6 I<BR>
just wanted to know on how to go about it.&nbsp; I'm
trying to implement <BR>
it in JAVA. If you have the code in Visual Basic or
C++ I think I can <BR>
understand the code. Can some one please help me get
started.<BR>
<BR>
Thanks<BR>
<BR>
S. Tiowanio<BR>
<BR>
</tt>

<br>

<!-- |**|begin egp html banner|**| -->

<table border=0 cellspacing=0 cellpadding=2>
<tr bgcolor=#FFFFCC>
<td align=center><font size="-1"
color=#003399><b>Yahoo! Groups Sponsor</b></font></td>
</tr>
<tr bgcolor=#FFFFFF>
<td align=center width=470><table border=0
cellpadding=0 cellspacing=0><tr><td align=center><font
face=arial size=-2>ADVERTISEMENT</font><br><a
href="http://rd.yahoo.com/M=213858.1650662.3186813.1261774/D=egroupweb/S=1705948\
923:HM/A=763352/R=0/*http://www.classmates.com/index.tf?s=5085"
target=_top><img
src="http://us.a1.yimg.com/us.yimg.com/a/cl/classmates_com2/bll_lrec1.gif"
alt="" width="300" height="250"
border="0"></a></td></tr></table></td>
</tr>
<tr><td><img alt="" width=1 height=1
src="http://us.adserver.yahoo.com/l?M=213858.1650662.3186813.1261774/D=egroupmai\
l/S=1705948923:HM/A=763352/rand=495581830"></td></tr>
</table>

<!-- |**|end egp html banner|**| -->


<br>
<tt>
To unsubscribe from this group, send an email to:<BR>
aima-talk-unsubscribe@yahoogroups.com<BR>
<BR>
</tt>
<br>

<br>
<tt>Your use of Yahoo! Groups is subject to the <a
href="http://docs.yahoo.com/info/terms/">Yahoo! Terms
of Service</a>.</tt>
</br>

</body></html>


____________________________________________________________
*NEW*   Connect to Yahoo! Messenger through your mobile phone   *NEW*
        Visit http://in.mobile.yahoo.com/smsmgr_signin.html

Reply | Forward | Messages in this Topic (2)
#18 From: tiowanio@...
Date: Sat Oct 20, 2001 6:45 pm
Subject: help for code ex.2.6 		tiowanio
Offline Offline
Send Email Send Email
  
Hi all,
I am a beginner to the field of AI, and am currently using the book
to get started. I was looking at the problems at the end of the
second chapter, some of which ask for the implementation. Ex 2.6 I
just wanted to know on how to go about it.  I'm trying to implement
it in JAVA. If you have the code in Visual Basic or C++ I think I can
understand the code. Can some one please help me get started.

Thanks

S. Tiowanio

Reply | Forward | Messages in this Topic (2)
#17 From: cipher4u@...
Date: Thu Oct 11, 2001 4:57 pm
Subject: Problem 		cipher4u@...
Send Email Send Email
  
One of the problems at the end of chapter number four asks the use
and the conditions for Bidirectional A star search. Though I have a
vague idea about the approach, could anyone suggest a possible
approach to the solution.

Reply | Forward | Messages in this Topic (1)
#16 From: "BRANDON C CORFMAN" <bcorfman@...>
Date: Tue Oct 9, 2001 1:20 pm
Subject: Re: Problems given at the end of each chapter 		bcorfman@...
Send Email Send Email
  
Hi Bhaskar,

I'm going through the book as well, and I'm one chapter ahead of you. Since
I've done my own version of VacuumWorld, I can offer a few things.

1) You don't need to code it in Lisp. I did it in C++, but the algorithms
from the chapter are very general and can be coded in your own favorite
language. I notice the authors now leaning toward Java, so you could try
that.
2) For my version, the most important things were creating a data structure
for the vacuum grid world and then another sub-grid of the simulation grid
for the agent for where it can see and move for every turn (since you don't
want the agent to be able to evaluate its moves by looking at the whole
grid.) For each grid square, there is a state, as is mentioned in the
chapter. This can be a struct or class in C++/Java, with each field of the
struct representing whether there's dirt or not, whether the square is
occupied, etc. (I used bits to represent states being on or off in my C++
implementation.) Then the rest of the problem involves creating an agent
class that can look and move around its subgrid and fire a rule based on the
state in its square.

If you want, you can take a look at my implementation at
http://userpages.umbc.edu/~bcorfm1
However, it will probably be helpful only if you know C++ and the Standard
Template Library (STL) fairly well.

Brandon

maddalab@... wrote:

> Hi all,
>   I am a beginner to the field of AI, and am currently using the book
> to get started. I was looking at the problems at the end of the
> second chapter, some of which ask for the implementation. Ex 2.5 I
> just wanted to know on how to go about it. Do I do it in lisp? Is
> there a code base that I could use? How do i go about it? Can some
> one please help me get started
>
> Thanks
> Bhaskar Maddala
>
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

Reply | Forward | Messages in this Topic (2)
#15 From: maddalab@...
Date: Mon Oct 8, 2001 5:37 pm
Subject: Problems given at the end of each chapter 		maddalab@...
Send Email Send Email
  
Hi all,
   I am a beginner to the field of AI, and am currently using the book
to get started. I was looking at the problems at the end of the
second chapter, some of which ask for the implementation. Ex 2.5 I
just wanted to know on how to go about it. Do I do it in lisp? Is
there a code base that I could use? How do i go about it? Can some
one please help me get started

Thanks
Bhaskar Maddala

Reply | Forward | Messages in this Topic (2)
#14 From: "Wheeler Ruml" <ruml@...>
Date: Fri Oct 5, 2001 5:34 pm
Subject: Re: alpha-beta code in chapter 5, p132 		ruml@...
Send Email Send Email
  
Whoops - the pseudo-code I posted didn't update alpha or beta at
all!  Sorry about that.  Revised:


Max-value (state, alpha, beta):
    when depth-cutoff (state), return SEF(state)
    value <-- -inf
    for each child of state
       value <-- max(value, Min-value (child, alpha, beta)
       alpha <-- max(value,alpha)    ;; this is the new line!
       when value > or = beta, return value
    return value


Min-value (state, alpha, beta):
    when depth-cutoff (state), return SEF(state)
    value <-- inf
    for each child of state
       value <-- min(value, Max-value (child, alpha, beta)
       beta <-- min(value, beta)    ;; this is the new line!
       when value < or = alpha, return value
    return value


Even though this approach prunes a little less than the full
alpha-beta code given in the book, it is much easier to explain
(which is why it seems to be the algorithm the book is currently
trying to explain).


Wheeler

Reply | Forward | Messages in this Topic (2)
#13 From: Wheeler Ruml <ruml@...>
Date: Thu Oct 4, 2001 11:13 pm
Subject: alpha-beta code in chapter 5, p132 		ruml@...
Send Email Send Email
  
(First off, I'd like to say that I love this textbook and use it all
the time, for teaching and to get up to research on topics outside my
specialty.  Hurrah for Stuart and Peter!)

I'm not sure that this counts as a bug, but I think that it's
confusing that the code in figure 5.8 doesn't actually pass up minimax
values.  In some cases, alpha and beta values are passed back up the
tree, creating some confusion.  Take the following example:

         n1
        / \
       /   \
      n2    n3
      |    / \
      0   /   \
         n4    ...
        /
       /
      n5
      |
      -3

Node n1 is a max node.  We init alpha to -inf and beta to inf.  At
node n2, this game reaches a terminal state with evaluation = 0.  This
value is passed up to n1, where it is used to update alpha (n1 being a
max node) to 0.  A call on n3 results in a call on n4 results in a
call on n5.  This is a terminal state, so its value of -3 is passed
back to n4.  n4 is a max node which had inherited an alpha of 0 and a
beta of inf.  According to the code in the book, the alpha value at n4
is updated to the max of the current value 0 and the child value -3.
Alpha remains 0.  Furthermore, alpha is passed back on exit from n4.
At n3 (which had been called with alpha = 0 and beta = inf), we are
updating beta to the min of its current value inf and its child's
value, which is 0.  So beta becomes 0, which is = to alpha, so we
prune away any other children on n3 and return 0 to the call from n1.
Note that both n2 and n3 now have value 0 from the perspective of n1!
I consider this a bug, since n3 should have a minimax value of -3 or
less.  We pruned correctly, but the wrong value was passed back.  The
strategy taken by the code in the book only works if we break ties at
the top level by preferring the leftmost action involved in the tie.
The solution is to be careful to always pass back the minimax value,
and not alpha or beta.  See the revised pseudo-code below:


Max-value (state, alpha, beta):
    when depth-cutoff (state), return SEF(state)
    value <-- -inf
    for each child of state
       value <-- max(value, Min-value (child, alpha, beta)
       when value > or = beta, return value
    return value


Min-value (state, alpha, beta):
    when depth-cutoff (state), return SEF(state)
    value <-- inf
    for each child of state
       value <-- min(value, Max-value (child, alpha, beta)
       when value < or = alpha, return value
    return value


The code in the book seems to be sticking close to the Knuth and Moore
1975 AIJ paper, computing the tree in K&M's fig 3.  I haven't used a
fine-toothed comb, but I don't see K&M mentioning the tie issue
either.  It only comes up when one programs an actual player, but I
would like to suggest that the 2nd edition make this a little more
explicit, if not adopt the revised pseudo-code above.

(Credit goes to Courtney O'Keefe and Jeff Shneidman who brought this
case to my attention.)

Thanks again for a wonderful book!


Wheeler Ruml
Instructor for CS 182, Harvard University
--
Wheeler Ruml, http://www.eecs.harvard.edu/~ruml/, 617-495-2081 voice
ruml@..., Maxwell Dworkin Lab 219    617-496-1066 fax

Reply | Forward | Messages in this Topic (2)
#12 From: gypsy bregovic <gypsybregovic@...>
Date: Fri Sep 21, 2001 1:13 pm
Subject: hello 		gypsybregovic@...
Send Email Send Email
  
Hi.I am a student from METU (Middle East Technical
University) which is located in Ankara,Turkey(uhh,it`s
really away from US:) ).This semester I will be taking
an AI course from my department (CS department as you
may easily guess).Our textbook is the book written by
Mr Norvig&Mr Russell.So while I was searching for the
authors on the net I foung this group.It was a great
surprise for me.I will be very pleased to collabarate
with you.By the way my name is Caglar Okat and I am in
my 4th year.
    Happy days

__________________________________________________
Terrorist Attacks on U.S. - How can you help?
Donate cash, emergency relief information
http://dailynews.yahoo.com/fc/US/Emergency_Information/

Reply | Forward | Messages in this Topic (3)
#11 From: "Peter@..." <peter@...>
Date: Fri Aug 17, 2001 9:02 pm
Subject: Re: porn link on berkeley AI webpage 		Peter@...
Send Email Send Email
  
That's strange -- i just tried it and it works ok.  Stuart, did you chang
something?

-Peter

on 8/13/01 11:15 AM, Brad H at anon473@... wrote:

> Hello, I was searching the web for my kid, found the following very useful
> page:
>
> http://www.cs.berkeley.edu/~russell/ai.html
>
> I am grateful to the folks keeping this kind of information on the web and
> up to date.  I'm just trying to fix a problem that could affect young kids
> finding this page:
>
> The link under "Robot Soccer" is for a porn site, and once you click there
> all sorts of new web browser windows pop up (advertisements) with x-rated
> pictures all over the place.
>
> This could be a mistake, or someone's idea of a joke, or whatever. I'm
> hoping it will get fixed.
>
> Thanks for your time,
> Bradley
>
> _________________________________________________________________
> Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp
>
>

Reply | Forward | Messages in this Topic (1)
#10 From: "Robert Vogler" <lowlevel@...>
Date: Thu Aug 16, 2001 4:58 pm
Subject: Typo in AI:MA Ch3 pg81 		lowlevel@...
Send Email Send Email
 
    The table giving the time and space complexity is wrong for uniform cost search.  Instead of b^d it should be b^m for both space and time complexity.  This also holds for A* search, so the complexity figures on pg 102 are also in error.
 
    Let me explain.  Let's assume we have a tree where the true solution is 1 layer deep but it requires a cost of 100 to go there.  All other transitions in the tree only cost 1.  (These are all on the non-optimal path).  UCS or A* will expand all of the nodes on the non-optimal paths until depth 100.  The complexity would be b^100 (b^m) for this example.  That is clearly much larger that b^1 (b^d).
 
    I found this while taking a test in my AI class at Brigham Young University.  I had to argue with the teacher to get my points back.
 
Robert Vogler
 
 
 

Reply | Forward | Messages in this Topic (1)
#9 From: "Andreas Nuechter" <nuechte@...>
Date: Wed Aug 8, 2001 7:02 am
Subject: some bugs and typos 		nuechte@...
Send Email Send Email
  
Hello,

I want to spot some bugs and typos I found in the AIMA book
while studying for an exam. These typos aren't listed on the
homepage. I am using the paperpack version of the book which is
sold outside the U.S. ((C) 1995).

page 278:
Gerneralized Resolution (implications)
There sould be dots between p_{j+1} and p_{n_1} in the last line.

page 474:
Orderability:
You surely mean xor instead of or. Exactly one of the terms should hold.

page 536 figure 18.6 (c):
Exchange the labels yes and no for patrons none and patrons
some. In figure 18.8 there is this case correct. (BTW: Another
bug in this figure was already spotted!)

page 640:
Discovering new predicates and new knowledge
I don't think quantum mechanics is a good object to be
discovered by inductive learning programs, since q.m.
intrinsically deals with probabilities.

page 743:
Shading
There should be a \cdot between vector n and vector s which is
the scalar product (dot product).

Unfortunately all other bugs I found were already listed on the
AIMA errata page.

But anyways it is a very good book!

Bye,
   Andreas Nuechter


---
   Andreas Nuechter
      ...student of computer science at University of Bonn
   Helenenstrasse 7, Apt. 63
   53225 Bonn, Germany
   nuechte@...   www.nuechti.de
   phone: +49-228-9140190  cell-phone: +49-177-7951270
   ICQ#: 19506497

Reply | Forward | Messages in this Topic (1)
#8 From: curtisbr@...
Date: Mon Aug 6, 2001 9:40 pm
Subject: Comments 		curtisbr@...
Send Email Send Email
  
I admire the book very much. Only one of the following is
unequivocally an "erratum," but hopefully at least one or two of the
others is worth considering.

p. 178, 6th bulletted point: "An inference process is complete if it
can derive all true conclusions from a set of premises." Wouldn't it
be better to say something like ". . . derive all the logical
consequences of a set of premises"? The "conclusion" of an invalid
argument might be true even though not a logical consequence of the
premises, and of course if one or more premises is false then there
will be false logical consequences that a complete process must be
able to derive. (Though the previous sentence does specify "true
premises.")

p. 193, line 8: "The term well-formed formula or wff is sometimes
used for sentences that have all their variables properly introduced
[by quantifiers]." This is almost the opposite of the usage in e.g.
Barwise and Etchemendy, *Language, Proof, and Logic*.  B&E
use "sentence" for a wff with all its variables bound by quantifiers!
On their usage, which I believe is pretty standard, "Brother(Richard,
x)" would be a wff but not a sentence.

p. 272, discussion of proof: should "Modus Ponens" be "Generalized
Modus Ponens"? Alternatively, there could be a note stating that
hereafter, "Modus Ponens" will be taken to mean "Generalized Modus
Ponens."

p. 278: some informal remarks about how to apply Generalized
Resolution would be very helpful.

pp. 663-4: "In programming languages, every statement is a
commmand."  (a) perhaps this should be "in *procedural* programming
languages . . ."? (b) in any case, the phrase "every statement is a
command" could be puzzling, since this occurs in the context of a
discussion of speech acts, and in speech act theory "statement" is
often used for a kind of speech act distinct from commands,
questions, etc.

p. 664, footnote 3, second sentence: first word should be "In",
not "It".

p. 679, discussion of indexicals: ". . . which are interpreted as
fluents" -- as far as I can tell, this is the only use of the
term 'fluent' except for p. 241, where it is defined. Since that was
over 400 pages earlier, a cross reference or reminder of its meaning
would be helpful!

Curtis Brown

Reply | Forward | Messages in this Topic (1)
#7 From: Peter Norvig <peter@...>
Date: Tue Jul 31, 2001 4:26 pm
Subject: Re: Second Edition 		peter@...
Send Email Send Email
  
We're a little behind schedule, but still aiming for near the end of 2001. For
those keeping score,
we have 18 chapters that are 90-95% done (just need a final proofing and error
checking), 4
chapters that are only 50% done, and the remaining 5 around 75% done.

-Peter

Mike Daren wrote:
>
> Hello,
>
> I was wondering if there was any updated information on when the
> second edition of the book will be released, other than that it will
> be by the end of 2001.
>
> Thanks,
>
> Mike Daren
>

_____________________________________________________________________
Peter Norvig, Director of Machine Learning, Google, http://google.com
pnorvig@...,  Voice:650-330-0100 x1248,  Fax:650-618-1499

Reply | Forward | Messages in this Topic (2)
#6 From: "Mike Daren" <mdaren@...>
Date: Tue Jul 31, 2001 2:05 am
Subject: Second Edition 		mdaren@...
Send Email Send Email
  
Hello,

I was wondering if there was any updated information on when the
second edition of the book will be released, other than that it will
be by the end of 2001.

Thanks,

Mike Daren

Reply | Forward | Messages in this Topic (2)
#5 From: Peter Norvig <peter@...>
Date: Tue Jul 3, 2001 4:32 pm
Subject: Re: Erratum in "AI: A modern approach" 		peter@...
Send Email Send Email
  
"Yahoo! Groups" wrote:
>
> We are unable to deliver the message from <pnorvig@...>
> to <aima-talk@yahoogroups.com>.
>
> The email address used to send your message is not subscribed to this
> group. If you are a member of this group, please be aware that you may
> only send messages to this group using the email address(es) you have
> registered with Yahoo! Groups.  Yahoo! Groups allows you to send messages
> using the email address you originally used to register, or an alternate
> email address you specify in your personal settings.
>
> If you would like to subscribe to this group:
> 1. visit
>    http://groups.yahoo.com/group/aima-talk/join
> -OR-
> 2. send email to aima-talk-subscribe@yahoogroups.com
>
> If you would like to specify an alternate email address:
> 1. visit
>    http://groups.yahoo.com/myprefs?edit=2
> 2. type your alternate email address in the area labeled "Alternate
>    posting addresses".
> 3. click the "Save Changes" button
> 4. wait approximately 10 minutes for the change to take effect
>
> After you follow these steps, you will be able to send messages
> to all your groups using this alternate email address.
>
> For further assistance, please email support@yahoogroups.com
> or visit http://help.yahoo.com/help/us/groups/
>
>   ------------------------------------------------------------------------
>
> Subject: Re: [aima-talk] Erratum in "AI: A modern approach"
> Date: Tue, 03 Jul 2001 09:23:17 -0700
> From: Peter Norvig <pnorvig@...>
> Organization: Google
OK, fixed for the next edition.

-Peter

> doodlematsu@... wrote:
> >
> > Hi,
> >
> > in the bibliography, the title of the Tarski 1935 publication should be
> > "Der Wahrheitsbegriff..." and not "Die Wahrheitsbegriff..." ;)
> > (on p. 898 in my edition)
> >
> > Regards,
> >
> > Sebastian Pado
> >

_____________________________________________________________________
Peter Norvig, Director of Machine Learning, Google, http://google.com
pnorvig@...,  Voice:650-330-0100 x1248,  Fax:650-618-1499

Reply | Forward | Messages in this Topic (2)
#4 From: doodlematsu@...
Date: Mon Jul 2, 2001 4:59 pm
Subject: Erratum in "AI: A modern approach" 		doodlematsu@...
Send Email Send Email
  
Hi,

in the bibliography, the title of the Tarski 1935 publication should be
"Der Wahrheitsbegriff..." and not "Die Wahrheitsbegriff..." ;)
(on p. 898 in my edition)

Regards,

Sebastian Pado

--
Sebastian Padó                           http://www.coli.uni-sb.de/~pado
Computational Linguistics - Saarland University - Saarbruecken - Germany

Reply | Forward | Messages in this Topic (2)
#3 From: "Schoen, Frank" <Frank.Schoen@...>
Date: Wed Jun 27, 2001 5:12 pm
Subject: AW: plz help me 		Frank.Schoen@...
Send Email Send Email
  
Hello Christian,

where do you study Computer Science?

I'm sorry.
But I don't have the Solution Manual either.

Best regards,
Frank

> -----Ursprüngliche Nachricht-----
> Von: csergiu77@... [mailto:csergiu77@...]
> Gesendet: Samstag, 23. Juni 2001 18:51
> An: aima-talk@yahoogroups.com
> Betreff: [aima-talk] plz help me
>
>
> Hello
> My name is Cristian and i study Computer Science .
> I am interested in Artif .I. so i study Artificial Intelligence: A
> Modern
> Approach., Russell and Norvig.
> The problem is that i don't have the Solution Manual for the
> exercises so i
> don't know if i did well them,(chapter 11-22)
> If u have an electronic format please send it too me it would help me
> a lot
> Thank you very much!
> Cristian   csergiu77@...
>            csergiu77@...
>
>
>
>
>
>
>
>
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>
>

Reply | Forward | Messages in this Topic (1)
#2 From: csergiu77@...
Date: Sat Jun 23, 2001 4:51 pm
Subject: plz help me 		csergiu77@...
Send Email Send Email
  
Hello
My name is Cristian and i study Computer Science .
I am interested in Artif .I. so i study Artificial Intelligence: A
Modern
Approach., Russell and Norvig.
The problem is that i don't have the Solution Manual for the
exercises so i
don't know if i did well them,(chapter 11-22)
If u have an electronic format please send it too me it would help me
a lot
Thank you very much!
Cristian   csergiu77@...
            csergiu77@...

Reply | Forward | Messages in this Topic (1)
#1 From: "Schoen, Frank" <Frank.Schoen@...>
Date: Wed Jun 6, 2001 11:26 am
Subject: Errata for AI: A Modern Approach 		Frank.Schoen@...
Send Email Send Email
  
Hello!

I study Computer Science and have a question about figure 4.4, page 98:

Why is f (Oradea) =  g (Oradea) + h (Oradea)
			 = 146 	 + 380 	 = 526

and not: 		 140 + 151 + 380 	 =
671
			 (cost from Arad to Sibiu
			 + cost from Sibiu to Oradea)

That is, why is g (Oradea) = 146 (way over Zerind)
and not 140 + 151 (way over Sibiu)?

Can somebody tell me, why?

Goodbye,
Frank

Reply | Forward | Messages in this Topic (1)
Messages 1 - 31 of 868   Newest  |  < Newer  |  Older >  |  Oldest
Message #
Search:
Advanced
Add to My Yahoo!      XML What's This?
Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help