Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

NETWORKS
2008

favoriteEmaildiscussreport

86views Computer Networks» more NETWORKS 2008»

A Reach and Bound algorithm for acyclic dynamic-programming networks

13 years 4 months ago

A Reach and Bound algorithm for acyclic dynamic-programming networks

Download www-personal.umich.edu

Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined to not lie on an optimal path. We introduce an -pruning condition that extends pruning to include a possible error in the pruning step. This results in a greater reduction of the computation time; however, This work was supported in part by a National Science Foundation GOALI (DMI-9900267) and a grant from General Motors 1

Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald

Real-time Traffic

Computer Networks | Dynamic Programming Network | NETWORKS 2008 | Pruning | Pruning Step |

claim paper

Related Content

» Learning Bayesian Network Structure using LP Relaxations

» A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bou...

» Visualization of clustered directed acyclic graphs with node interleaving

» New dynamic programming algorithms for the resource constrained elementary shortest path p...

» A Dynamic Programming Approach for Routing in Wireless Mesh Networks

» Inventory placement in acyclic supply chain networks

» Better Landmarks Within Reach

» Discovering Sequence Similarity by the Algorithmic Significance Method

» Inference in Multilayer Networks via Large Deviation Bounds

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	NETWORKS
Authors	Matthew D. Bailey, Robert L. Smith, Jeffrey M. Alden

Comments (0)