Hi,

On page 34, What do you understand by:
percept sequence:[A,clean],[A,clean]
The first percept changes the position of the vacuum-cleaner
to place B and in that position, the second percept has no meaning
for the agent.

Amir.

Hi,

On page 34, What do you understand by:
percept sequence:[A,clean],[A,clean]
The first percept changes the position of the vacuum-cleaner
to place B and in that position, the second percept has no meaning
for the agent.

Amir.

i need a language tutor preferably in c,java.
it should take a sentence from user...and notify the user of the
mistakes that he made using parsing or other techniques.........

it is sort of....urgent ...

HELLO TO ALL AIMA-ITES

  THE SECOND EDITION OF AIMA IS FANTASTIC.

  I JUST NEED SOME HELP ON THE MISSIONARIES AND CANNIBALS PROBLEM
  IF ANYONE COULD PROVIDE A SOLUTION,IT WOULD BE GREAT. THIS WILL ALSO
HELP ME WITH THE FARMER,FOX,GOOSE,GRAIN PROBLEM BECAUSE I THINK THEY
ARE QUITE SIMILAR.

Hey, I was wondering if anybody could help me with question 9.11 about finding
who the
person is.

question:  P. 317
A popular children's riddle is "Brothers and sisters have I none, but that man's
father is my
father's son."  Use the rules of the family domain(Chapter 8, page 254) to show
who that
man is.  You may apply any of the inference mehtods described in this chapter. 
Why do
you think that this riddle is difficult?

any suggestions??

thanks,
brandon

Hey, anyone has solution for 20.19? It'll save my life! Tks

I really dont understand how I could return the action in Sucessors
(state) with value v (p. 166). In facts, I don't understand how a
sucessors of a state is associated with a value ?

Thanks for help.

(I use Scheme (dialect of Lisp) to implement the code from the book.)

Dear Colleague,


International Conference on Information Technology - ICIT 2004 to be
held on December 17-19, 2004, Istanbul, Turkey is sponsored by
International InformationTechnology Society. The ICIT 2004
scientific committee will solicit high quality papers containing
original contributions in all areas of experimental, theoretical and
application-oriented aspects of Information Technology.

Paper Submission
Prospective authors are strongly encouraged to submit 4 pages paper
(A4 size) by due date electronically (e-mail: ijit@...) in
pdf/doc format at
http://www.ijit.org/samplepaper.doc

***All peer-reviewed accepted papers will be published in the
International Journal of Information Technology!***

Important Dates
Paper submission Due                :November 30, 2004
Conference Dates                    :December 17-19 , 2004


We look forward to seeing you in Istanbul!


Organizing Committees
ICIT 2004 ISTANBUL
http://www.ijit.org/icit2004

Hope someone can help me with this one.  completely stuck.  any solutions out
there?  it's
on page 490 about proving the conditionalized version of the general product
rule.

P(X,Y|e) = P(X|Y,e) P(Y|e)

part b:  prove the conditionalized version of Bayes' Rule in Equation (13.10)

P(Y|X,e) = P(X|Y,e) P(Y|e)
                 ------------
                         P(X)

ANY HELP WOULD BE GREAT.

thanks,
brandon

That's one of those "wave your hands and magic
appears" moments in the book.  I don't know Scheme (or
Lisp) but when I coded it in Java, I set a
class-variable for the best move every time I was
ready to leave the max algorithm.  Sure, it gets set a
couple of times when you're deep in the recursion, but
on your way out at the top it'll get set to the next
move properly.

Rob G.
--- solunne <solunne@...> wrote:

>
>
>
> I really dont understand how I could return the
> action in Sucessors
> (state) with value v (p. 166). In facts, I don't
> understand how a
> sucessors of a state is associated with a value ?
>
> Thanks for help.
>
> (I use Scheme (dialect of Lisp) to implement the
> code from the book.)
>
>
>
>
>
>
>




__________________________________
Do you Yahoo!?
Check out the new Yahoo! Front Page.
www.yahoo.com

Both follow the normal proof methods ....

Note that P(X,Y|e) = P(X,Y,e)/P(e)
and P(X|Y,e) = P(X,Y,e)/P(Y,e)
and P(Y|e) = P(Y,e)/P(e)

The first part is immediate from this.

The second part is almost trivial after this ...
Note that,
P(X,Y|e) = P(X|Y,e) P(Y|e)
also,
P(X,Y|e) = P(Y|X,e) P(X|e)

Can u finish it off from here?
-- AI

--- In aima-talk@yahoogroups.com, "brandon_pitt_47"
<brandon_pitt_47@y...> wrote:
>
>
> Hope someone can help me with this one.  completely stuck.  any
solutions out there?  it's
> on page 490 about proving the conditionalized version of the general
product rule.
>
> P(X,Y|e) = P(X|Y,e) P(Y|e)
>
> part b:  prove the conditionalized version of Bayes' Rule in
Equation (13.10)
>
> P(Y|X,e) = P(X|Y,e) P(Y|e)
>                 ------------
>                         P(X)
>
> ANY HELP WOULD BE GREAT.
>
> thanks,
> brandon

yes, i can.  thanks again for your help.

brandon



__________________________________
Do you Yahoo!?
Check out the new Yahoo! Front Page.
www.yahoo.com

HI...
I tried a lot to find the code in LISP that solve the TSP with the
A* algorithm ,so if anybody can help me i'll be very grateful to
him...
yours...
bestosm2002

Hi, All.

If someone can tell me how to calculate the log-likelifood value
listed on page 730, -2044, please help me!
I tried to calculate this by below code(in Java language),
but I got such an odd value, -4041...
What was wrong?? I'm totally confused...

Thanks a lot.

-- code below
double[] values = new double[7];
// for bag
values[0] = log(0.6) * (1000 * 0.6) + log(0.4) * (1000 * 0.4);
// for flavor (560 for total number of cherry)
values[1] = log(0.6) * (560 * 0.6) + log(0.4) * (440 * 0.6);
values[2] = log(0.4) * (560 * 0.4) + log(0.6) * (440 * 0.4);
// for wrapper (545 for total number of red wrapper)
values[3] = log(0.6) * (545 * 0.6) + log(0.4) * (455 * 0.6);
values[4] = log(0.4) * (545 * 0.4) + log(0.6) * (455 * 0.4);
// for hole (550 for total number of holed)
values[5] = log(0.6) * (550 * 0.6) + log(0.4) * (450 * 0.6);
values[6] = log(0.4) * (550 * 0.4) + log(0.6) * (450 * 0.4);

* log() means Math.log(value) / Math.log(2)

<Please accept my apology if you have received multiple copies of the
same>

                           K B C S 2004
     INTERNATIONAL CONFERENCE ON KNOWLEDGE BASED COMPUTER SYSTEMS
             Hyderabad, India.  December 19-22, 2004
                 http://www.ncst.ernet.in/kbcs2004/

                       Call for Participation

The International Conference on Knowledge Based Computer Systems will
be held in Hyderabad, India during December 19-22,2004. The
conference is intended to act as a forum for promoting interaction
among researchers in the field of Artificial Intelligence in India
and abroad.

There will be a three-day conference during December 20-22, 2004,
preceded by a day of pre-conference tutorials on December 19, 2004.
The conference programme consists of presentations of selected
papers, invited talks, panel discussion and sponsor presentation.

Over 200 papers were submitted to the conference from India and
abroad. After a rigorous international refereeing process, about 50
papers have been selected, which will be presented during the
conference. The papers span areas such as Data Mining, Information
Retrieval, Intelligent Agents, Machine Learning, OCR, Reasoning,
Planning and Scheduling, Search Techniques, etc.

Invited Talks by:
----------------
* Prof. Tony Cohn, University of Leeds, UK.
* Prof. Martin Kay, Trinity College, UK.
* Prof. Ramon Mántaras, Campus Universitat Autonoma de Barcelona,
   Spain.
* Prof. Abdul Sattar, Griffith University, Australia.
* Prof. Manuela M. Veloso, Carnegie Mellon University, USA.

Pre-Conference Tutorials:
------------------------
==> Speech Recognition and Synthesis (Full Day)
       * Prof. Samudravijaya K., TIFR, Mumbai, India.
       * Mr. S. P. Kishore, IIIT Hyderabad, India and LTI CMU, USA.
       * Dr. R N V Sitaram HP Labs, Bangalore, India.

==> Pattern Evolution Algorithms for Search, Optimization and
     Data Mining    (Full Day)
       * Dr. V. Sunderarajan, CDAC Pune, India.
       * Dr. V. K. Jayaraman, National Chemical Laboratory,
         Pune, India.

==> 'Evolvable Hardware' - Implication on Engineering Design and
      Intelligence of Autonomous Systems (Half Day)
        * Prof. Mircea Gh. Negoita, Wellington Institute of Technology
          (WelTec),New Zealand.

Registration Fees:
-----------------
Conference:
   * Non-profit R&D and Educational Institutions : Rs. 2800/- (100$)
   * Other Institutions : Rs. 4000/- (140$)
   * Students : Rs 1500/- (50$)

Tutorial: (full-day)
   * Non-profit R&D and Educational Institutions : Rs. 2200/- (70$)
   * Other Institutions  : Rs. 3500/- (120$)
   * Students : Rs 800/- (40$)

Tutorial: (half-day)
   * Non-profit R&D and Educational Institutions : Rs. 1500/- (50$)
   * Other Institutions  : Rs. 2500/- (80$)
   * Students : Rs 500/- (25$)

For registration details, please visit the
URL: http://www.ncst.ernet.in/kbcs2004/registration.shtml

Conference Venue:
-----------------
ITC Hotel Kakatiya Sheraton & Towers,
6-3-1187, Begumpet, Hyderabad - 500 016, A.P., India.

Tutorial Venue:
---------------
IIIT, Gachibowli, Hyderabad - 500 019, A.P., India.

Advisory Committee:
------------------
Aravind K. Joshi, University of Pennsylvania
P.V.S. Rao, Tata Infotech Ltd., Mumbai
R. Narasimhan, CMC, Bangalore

Programme Committee:
-------------------
K.S.R. Anjaneyulu, HP Labs, Bangalore
Vivek Balaraman, TRDDC, Pune
Pushpak Bhattacharya, IIT Mumbai
PP Chakraborti, IIT Kharagpur
S. Kambhampati, Arizona State University
M. Narasimha Murty, IISc, Bangalore
Bernd Neumann, University of Hamburg
Arun K Pujari, University of Hyderabad
S. Ramani, HP Labs, Bangalore
P.V.S. Rao, Tata Infotech Ltd., Mumbai (Chair)
Durgesh D. Rao, DR Systems, Mumbai
P. Saint-Dizier, University of Paul Sabatier, France
K. Samudravijaya, TIFR, Mumbai
R. Sangal, IIIT, Hyderabad
M. Sasikumar, C-DAC Mumbai (formerly NCST) (co-chair)
S. Sen Gupta, Tata Infotech Ltd., Mumbai
R. Uthurusamy, GMR Labs, USA (co-chair)

Request for Information:
-----------------------
For further information please refer to the KBCS-2004 home page or
write to

KBCS-2004 Secretariat,
C-DAC Mumbai (formerly NCST)
Raintree Marg, Near Bharati Vidyapeeth,
Opp. Kharghar Railway Station,
Sector 7, CBD Belapur,
Navi Mumbai - 400 614, INDIA.
E-mail: kbcs@...
Phone: +91-22-27560013
Fax: +91-22-27560004
URL: http://www.ncst.ernet.in/kbcs2004/

Dear op4cfp,

Please talk to your ISP to fix their open-relay problem; otherwise, you
mails are tagged as spam. Or change your ISP.

Group: sorry for the off-topic.

-s

On Mon, 22 Nov 2004, op4cfp wrote:

> Date: Mon, 22 Nov 2004 08:50:39 -0000
> From: op4cfp <op4cfp@...>
> Reply-To: aima-talk@yahoogroups.com
> To: aima-talk@yahoogroups.com
> Subject: SPAM: [aima-talk] KBCS 2004: Call for Participation
>
>
> ---------------------------------------------------------------------------
>
>   *** SPAM *** SPAM *** SPAM *** SPAM *** SPAM *** SPAM *** SPAM ***
>
> This message has been identified as spam or dangerous by the TEST version
> of the Concordia University e-mail transport system.  After a test period,
> messages such as this one will simply be REJECTED.  If we made a mistake,
> and you believe that this message *should* be delivered to you, please
> contact abuse@... immediately,
> and include the COMPLETE HEADERS from this message.
> Explain that you believe the message was mistakenly identified as spam.
>
> For more information about the anti-spam system, see:
> http://www.encs.concordia.ca/~fig/public/email/spam/
>
>    This testing rule will start rejecting mail on: March 31, 2004
>    unless we get problem reports before then at abuse@....
>
> Rule:     spamassassin score 20.511 >= 20.0
> Queue:    perseverance.encs.concordia.ca iAMDeEbj026845
>
> Details:
>
> Spam detection software, running on the system
"perseverance.encs.concordia.ca", has
> identified this incoming email as possible spam.  The original message
> has been attached to this so you can view it (if it isn't spam) or block
> similar future email.  If you have any questions, see
> postmaster@... for details.
>
> Content preview:  <Please accept my apology if you have received multiple
>   copies of the same> K B C S 2004 INTERNATIONAL CONFERENCE ON KNOWLEDGE
>   BASED COMPUTER SYSTEMS Hyderabad, India. December 19-22, 2004
>   http://www.ncst.ernet.in/kbcs2004/ [...]
>
> Content analysis details:   (20.5 points, 5.0 required)
>
>  pts rule name              description
> ---- ---------------------- --------------------------------------------------
>  0.0 T_CONCORDIA_LOCAL_RETURN Return Path includes local address.
>  3.4 FORGED_YAHOO_RCVD      'From' yahoo.com does not match 'Received' headers
>  1.1 RCVD_IN_SORBS_HTTP     RBL: SORBS: sender is open HTTP proxy server
>                             [202.54.51.5 listed in dnsbl.sorbs.net]
>  4.3 RCVD_IN_OPM            RBL: Received via a relay in opm.blitzed.org
>                             [202.54.51.5 listed in opm.blitzed.org]
>  1.1 RCVD_IN_NJABL_PROXY    RBL: NJABL: sender is an open proxy
>                             [202.54.51.5 listed in dnsbl.njabl.org]
>  4.3 RCVD_IN_OPM_HTTP_POST  RBL: OPM: sender is open HTTP POST proxy
>                             [202.54.51.5 listed in opm.blitzed.org]
>  1.0 RCVD_IN_NJABL          RBL: Received via a relay in dnsbl.njabl.org
>                             [202.54.51.5 listed in dnsbl.njabl.org]
>  1.0 RCVD_IN_SORBS          RBL: Received via a relay in dnsbl.sorbs.net
>                             [202.54.51.5 listed in dnsbl.sorbs.net]
>  3.1 RCVD_IN_DSBL           RBL: Received via a relay in list.dsbl.org
>                             [<http://dsbl.org/listing?ip=202.54.51.5>]
>  1.0 RCVD_IN_BL_SPAMCOP_NET RBL: Received via a relay in bl.spamcop.net
>                  [Blocked - see <http://www.spamcop.net/bl.shtml?202.54.51.5>]
>  0.1 CONCORDIA_HELO_NEQ_PTR HELO argument does not match PTR
>
>
>
> ---------------------------------------------------------------------------
>

--
Serguei A. Mokhov            |  /~\    The ASCII
Computer Science Department  |  \ / Ribbon Campaign
Concordia University         |   X    Against HTML
Montreal, Quebec, Canada     |  / \      Email!

Hello all, this is brandon.  I was wondering if anybody had the
solution (in PYTHON) to this algorithm.  I will even take a template.
  thanks and have a happy thanksgiving

brandon

please help me
i need a hueristic function for 8puzzle

please help me
i need a hueristic function for 8puzzle

--- In aima-talk@yahoogroups.com, "memo_27512" <memo_27512@y...>
wrote:
>
>
> please help me
> i need a hueristic function for 8puzzle

Check the book they already have given 3 heuristics for 8 puzzle.

1> Number of misplaced tiles pg 106/108
2> Manhattan distance pg 106/108
3> Gaschnig's Heuristic pg 135 prob 4.9

pages numbered according to Second Edition of the book.

hi,
Sec 4.2 of the book clearly explains two heuristic functions for the
eightpuzzle.
You might also want to look at the java implementation of both these
heuristics.
Regds,
  Ravi


--- In aima-talk@yahoogroups.com, "memo_27512" <memo_27512@y...> wrote:
>
>
> please help me
> i need a hueristic function for 8puzzle

How about the heuristics given in the text (p. 102 first edition)? One
of those is the sum of the Manhattan distances between blocks' current
positions and their positions in the solved puzzle.

David

On Dec 1, 2004, at 3:33 AM, memo_27512 wrote:

>
>
>
> please help me
> i need a hueristic function for 8puzzle

Q2.3. What is difference between agent functions and agent programs?
and its part a.

a.  Can there be more than one agent program that implements a given
agent function? Give an example, or show why one is not possible.

I need help in this regard.

--
Regards,
Shams Qazi
Web Master
National University of Sciences & Technology
Rawalpindi, Pakistan.
Off: 009251-9271995     Cell: 0092300-9565025

thank you
but I need a hueristic function better than
Number of misplaced tiles pg 106/108
Manhattan distance pg 106/108

--- In aima-talk@yahoogroups.com, "j1mmy_n3u7120n" <padmatv@v...>
wrote:
>
>
> --- In aima-talk@yahoogroups.com, "memo_27512" <memo_27512@y...>
> wrote:
> >
> >
> > please help me
> > i need a hueristic function for 8puzzle
>
> Check the book they already have given 3 heuristics for 8 puzzle.
>
> 1> Number of misplaced tiles pg 106/108
> 2> Manhattan distance pg 106/108
> 3> Gaschnig's Heuristic pg 135 prob 4.9
>
> pages numbered according to Second Edition of the book.

thank you very much
I need it in delphi
--- In aima-talk@yahoogroups.com, Brandon Iskey
<brandon_pitt_47@y...> wrote:
> i have it in python.  is that ok??
>
> brandon
>
>
> ---------------------------------
> Do you Yahoo!?
>  Yahoo! Mail - Helps protect you from nasty viruses.

thank you
bau i need another hueristic function

--- In aima-talk@yahoogroups.com, "magesmail" <magesmail@y...> wrote:
>
>
> hi,
> Sec 4.2 of the book clearly explains two heuristic functions for
the
> eightpuzzle.
> You might also want to look at the java implementation of both
these
> heuristics.
> Regds,
>  Ravi
>
>
> --- In aima-talk@yahoogroups.com, "memo_27512" <memo_27512@y...>
wrote:
> >
> >
> > please help me
> > i need a hueristic function for 8puzzle

thank you
but i need another hueristic function that act better
--- In aima-talk@yahoogroups.com, David Faden <dfaden@i...> wrote:
> How about the heuristics given in the text (p. 102 first edition)?
One
> of those is the sum of the Manhattan distances between blocks'
current
> positions and their positions in the solved puzzle.
>
> David
>
> On Dec 1, 2004, at 3:33 AM, memo_27512 wrote:
>
> >
> >
> >
> > please help me
> > i need a hueristic function for 8puzzle