Loading ...
Sorry, an error occurred while loading the content.
Advanced Search
Author
Subject
Message
Special notice only

14 results from messages in aima-talk

Advanced Search
  • [ Apologies if you receive multiple copies of this announcement. ] Hello: Concordia University is organizing C3S2E'11, the Fourth International C* Conference on Computer Science and Software Engineering, in May 2011. With so many questionable academic meetings and their CFPs which we get everyday, direct emailing has become a nuisance; hence, we need to depend on the old reliable...
    Serguei A. Mokhov on behalf of C3S2E-11 Feb 16, 2011
  • 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 > Reply-To: aima-talk@^$1 > To: aima-talk@^$2 > Subject: SPAM: [aima-talk] KBCS 2004: Call for Participation...
    Serguei A. Mokhov Nov 22, 2004
  • On Tue, 23 Mar 2004, al kin wrote: > > i'm looking for a thesis topic in parallel computing. i'm wondering if i > can find a parallel algorithm for VRP. Why don't you attempt to parallelize existing ones? > --- > alkin/philippines -- Serguei A. Mokhov | /~\ The ASCII Computer Science Department | \ / Ribbon Campaign Concordia University | X Against HTML Montreal, Quebec, Canada...
    Serguei A. Mokhov Mar 23, 2004
  • Fetching Sponsored Content...
  • IMHO: ----- Original Message ----- From: "icewind0" Sent: October 03, 2003 2:31 PM > I think my problem is that I'm having trouble visualizing the game > tree. Does a "die-roll sequence" define the game tree? No. It only defines a particular path within the tree. > What exactly is > a "die-roll sequence"? An outcome of N rolls of the dice. > I'm assuming its just 50 rolls of the...
    Serguei Mokhov Oct 4, 2003
  • On Tue, 3 Jun 2003, [iso-8859-1] Alberto Vera wrote: > Hello: > > Could you tell me about any method to answer this questions? > a) How many hidden layers do I set in a neural network? > b) How many neurons do I set for each hidden layer ? > c) how many layers is it better to set in a neural network? These are /research/ questions. For c) minimum you have to have two, input and...
    Serguei A. Mokhov Jun 3, 2003
  • ----- Original Message ----- From: "flamesplash" Sent: September 22, 2002 11:01 PM > I was just curious if anyone knew what the heuristics generated by > the ABSOLVER program, mentioned on page 103, were or a web site that > explains them. www.google.com Keyword: ABSOLVER That document might be of interest: -s
    Serguei Mokhov Sep 22, 2002
  • ----- Original Message ----- From: "Will Deakin" Sent: September 20, 2002 5:44 PM > >Serguei Mokhov ha scritto: > > Not exactly LISP, but a subset. > Without meaning to be painfully pedantic, if you mean > by LISP (or lisp since this looks a bit quieter on the > page :) that you are talking about common lisp -- I wasn't talking about any particular flavour of lisp. > which I belive...
    Serguei Mokhov Sep 20, 2002
  • ----- Original Message ----- From: Sent: September 20, 2002 3:37 AM > wein3150 writes: > > Would using MIT Scheme 7.5 for W98 compile the source code from the > > text by changing the file extensions from .lisp to .scm? > > > > Thanks. > > scheme is not lisp, so I don't think so... Not exactly LISP, but a subset. > But why don't you just try > it and see for yourself??? I agree...
    Serguei Mokhov Sep 20, 2002
  • ----- Original Message ----- From: "Alberto Vera" Sent: September 11, 2002 3:34 PM > (defrule warning > ?suma <- (numerrores ?error) > (> ?error 1) > => > (retract ?suma) > (printout t ?error " WARNING " ?error crlf) > ) > > I want to execute this if ?error is > 1, but i don't see any message. > > What is wrong in my rule? Personally, I don't see anything wrong with your rule with...
    Serguei Mokhov Sep 16, 2002
  • Hi Gavin, ----- Original Message ----- From: "gavtks78" Sent: August 22, 2002 8:48 PM > Hi, > I'm supposed to think of some problem domains that i can apply the ^^^^^^^^^^^^^^^^^^^^^ > techniques of uninformed and informed searches. Can anyone help in > this area? thanks! *You* are supposed to think, not us ;-) You could also search google or somthing on the subj. When you think...
    Serguei Mokhov Sep 10, 2002