Speeding up dynamic programming

Newsgroups	comp.programming
Date	2016-03-01 06:50 -0800
Message-ID	<a2ab78d9-3682-4f48-b3ec-dc9bf293f5cd@googlegroups.com> (permalink)
Subject	Speeding up dynamic programming
From	Paul <pepstein5@gmail.com>

Show all headers | View raw

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

Back to comp.programming | Previous | Next — Next in thread | Find similar | Unroll thread

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