Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #6282
| From | Randy Howard <rhoward.mx@EverybodyUsesIt.com> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Re: Speeding up dynamic programming |
| Date | 2016-03-02 10:12 -0600 |
| Organization | Aioe.org NNTP Server |
| Message-ID | <nb73cp$rgq$2@gioia.aioe.org> (permalink) |
| References | <a2ab78d9-3682-4f48-b3ec-dc9bf293f5cd@googlegroups.com> |
On 3/1/16 8:50 AM, Paul wrote: > I'm interested in the question of how and when naive dynamic > programming techniques can be speeded up. One example is when > the quadrangle inequality holds but that is a fairly restricted > condition. Can anyone point me to a summary of elementary > techniques which hold more widely? Thank you, > > Paul From the terms used above, it seems likely that you've already read the paper "The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total-Monotonicity" by Bein, Golin, Larmore & Zhang. If not you might want to look at this: http://www.egr.unlv.edu/~bein/pubs/knuthyaotalg.pdf Exploring the references at the end of the paper will perhaps also be of some benefit. -- Randy Howard (replace the obvious text in the obvious way if you wish to contact me directly)
Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Speeding up dynamic programming Paul <pepstein5@gmail.com> - 2016-03-01 06:50 -0800
Re: Speeding up dynamic programming Randy Howard <rhoward.mx@EverybodyUsesIt.com> - 2016-03-02 10:12 -0600
Re: Speeding up dynamic programming Paul <pepstein5@gmail.com> - 2016-03-06 11:43 -0800
csiph-web