From: Ken A. <kan...@bb...> - 2003-09-09 00:34:21
|
This is very cool! And a Lisp application! I don't understand their algorithm, but they seem to use Turing Machines! It sounds like moderinzing the rule language would help! k At 09:04 PM 9/6/2003 -0400, you wrote: >Hi Ken, > >If you haven't met Carl yet, I hope you do some day. If you've ever used the Orbitz travel service, you've likely used his software. Now he's made a presentation of how it all works: > >http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ ITA-software-travel-complexity.pdf > >Geoffrey > >Begin forwarded message: > >>From: Carl de Marcken <ca...@it...> >>Date: Sat Sep 6, 2003 7:33:58 PM US/Eastern >>To: Geoffrey Knauth <ge...@kn...> >>Subject: Re: Travel planning complexity >> >>i have no problems with forwarding; hope life is good. >> >>Geoffrey Knauth wrote: >> >>>Hi Carl, >>>That looks really interesting, thank you very much! I look forward to reading it in more depth. >>>Do you mind if I forward a copy to Ken Anderson at BBN? Or you could send him one yourself at kan...@bb... and mention my name. I'm sure he would love to see this too. Speaking of which, if you haven't given a talk at BBN about your work, maybe one of these days you should. They would eat it up. >>>All the best, >>>Geoffrey >>>-- >>>Geoffrey S. Knauth | http://knauth.org/gsk >>>On Saturday, September 6, 2003, at 05:06 AM, Carl de Marcken wrote: >>>>Hello, >>>> >>>>If you're getting this, it means you either once asked me for slides from my talks on the computational complexity of air travel planning, or for one reason or another I thought you'd be interested. After far too many years of procrastination I've put a set of annotated slides on the web. >>>> >>>>PDF (recommended): >>>> >>>>http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ ITA-software-travel-complexity.pdf >>>> >>>>HTML: >>>> >>>>http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ ITA-software-travel-complexity.html >>>> >>>>Carl de Marcken |