<--- Back to Details
First PageDocument Content
Graph theory / Network flow / Mathematical optimization / Routing algorithms / Search algorithms / Segmentation / A* search algorithm / Maximum flow problem / Dynamic programming / Mathematics / Operations research / Applied mathematics
Date: 2014-09-14 11:24:44
Graph theory
Network flow
Mathematical optimization
Routing algorithms
Search algorithms
Segmentation
A* search algorithm
Maximum flow problem
Dynamic programming
Mathematics
Operations research
Applied mathematics

Microsoft PowerPoint - Layered-Graph-search-example.ppt [Compatibility Mode]

Add to Reading List

Source URL: www.csd.uwo.ca

Download Document from Source Website

File Size: 1,47 MB

Share Document on Facebook

Similar Documents

VEHICLE ROUTING ALGORITHMS FOR RADIALLY ESCAPING TARGETS PUSHKARINI AGHARKAR †,

DocID: 1vkvr - View Document

T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing

DocID: 1uOB1 - View Document

Improving Non-Minimal and Adaptive Routing Algorithms in Slim Fly Networks Pedro Y´ebenes∗ , Jesus Escudero-Sahuquillo∗ , Pedro J. Garc´ıa∗ , Francisco J. Quiles∗ , and Torsten Hoefler† ∗ Department of Co

DocID: 1tVFZ - View Document

Trust-based Anonymous Communication: Adversary Models and Routing Algorithms ∗ Aaron Johnson

DocID: 1tMc3 - View Document

1 Distributed routing algorithms to manage power flow in agent-based active distribution network Phuong H. Nguyen, Wil L. Kling, Member, IEEE, Giorgos Georgiadis, Marina Papatriantafilou, Le Anh Tuan, Member IEEE, Lina

DocID: 1sdUe - View Document