Article View: comp.lang.prolog
Article #184Re: memoization
From: Fernando Pereira
Date: Sun, 12 Apr 1992 20:13
Date: Sun, 12 Apr 1992 20:13
15 lines
1151 bytes
1151 bytes
In article <1992Apr12.172448.21191@acsu.buffalo.edu> bharat@acsu.buffalo.edu (Bharat Jayaraman) writes: > >Regarding 4), may I ask what is a "dynamic-programming solution", i.e., >would you not entertain a top-down solution with memoization? If not, >why not? This is a crucial question, as it has serious implications for all >WAM-based implementations. Many thanks for the references. As for "dynamic programming" solutions, I was concerned more specifically with the ability to imitate the best dynamic programming solutions for problems such as shortest path, not just with the ability to store intermediate results (which may not be enough). Fernando Pereira AT&T Bell Laboratories, Murray Hill pereira@research.att.com
Technical Details
Message-ID:
<22553@alice.att.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!att!andante!alice!pereiraReferences:
<1992Apr12.172448.21191@acsu.buffalo.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!att!andante!alice!pereira From: pereira@alice.att.com (Fernando Pereira) Newsgroups: comp.lang.prolog Subject: Re: memoization Message-ID: <22553@alice.att.com> Date: 12 Apr 92 20:13:45 GMT References: <1992Apr12.172448.21191@acsu.buffalo.edu> Reply-To: pereira@alice.UUCP () Organization: AT&T, Bell Labs Lines: 15