Re: Pittsburgh Perl Workshop practice talk

[Walt Mankowski <waltman@pobox.com>]

Jim says the room isn't available then, so instead I'm going to do
this talk on Wednesday, September 20.  This gives me an extra 2 days
to work on it, which is probably a good thing.

Walt

On Tue, Sep 12, 2006 at 11:51:48AM -0400, Walt Mankowski wrote:
> Well, I haven't seen any comments on this, so I'm going to assume the
> September 18 date works for people.  Jim, can you check if the meeting
> room's available then?
> 
> Thanks.
> 
> Walt
> 
> On Tue, Sep 05, 2006 at 03:54:35PM -0400, Walt Mankowski wrote:
> > The Pittsburgh Perl Workshop's coming up in just about 2 1/2 weeks on
> > September 23.  They recently posted their schedule at
> > http://www.pghpw.org/schedule.html.  You might notice that they've
> > scheduled me talk in between Andy Lester and the afternoon break, so I
> > definitely need to do a practice talk ahead of time.  How does Monday,
> > September 18 sound for a tech meeting?
> > 
> > The title of my talk is "Approximation Algorithms in Perl".  They
> > don't have links to the talk abstracts up yet, so here's what I sent
> > them:
> > 
> >   OVERVIEW
> > 
> >   This talk will show easy and clever ways to code approximate
> >   solutions to NP-complete problems.
> > 
> >   KNOWLEDGE LEVEL
> > 
> >   The Perl I'll show in this talk will be fairly straightforward and
> >   should be easily understandable by programmers at most skill levels.
> >   However, I might touch on a little math and computer science topics,
> >   in particular big-O notation and NP-completeness.
> > 
> >   DETAILED ABSTRACT
> > 
> >   Your boss has given you a new assignment.  Remembering back to that
> >   intro to programming course you took when you were in college, you
> >   realize that the problem he's asked you to solve is NP-complete.
> >   People smarter that you have been working on this since before you
> >   were born and haven't been able to come with any good solutions, so
> >   chances are you won't, either.  So what do you do?  It turns out
> >   that many NP-complete problems have approximate solutions that are
> >   surprisingly close to optimal.  Even better, many of them are really
> >   easy to code.  This talk begins with a brief introduction to NP-
> >   completeness, then shows several simple approximate solutions to
> >   famous NP-complete problems.
> > 
> > Basically I'm going to be summarizing a 10 week long course I took at
> > Drexel last spring into half an hour. :)
> > 
> > Walt
> > 
> 
>

Attachment: signature.asc
Description: Digital signature