<--- Back to Details
First PageDocument Content
Operations research / Dynamic programming / Routing algorithms / Finite fields / Optimal control / XTR / Sensor / Shortest path problem / Floyd–Warshall algorithm / Mathematics / Theoretical computer science / Applied mathematics
Date: 2011-10-14 01:37:09
Operations research
Dynamic programming
Routing algorithms
Finite fields
Optimal control
XTR
Sensor
Shortest path problem
Floyd–Warshall algorithm
Mathematics
Theoretical computer science
Applied mathematics

Y:/workspace/work/research/papers/icra11[removed]paper.dvi

Add to Reading List

Source URL: msl.cs.uiuc.edu

Download Document from Source Website

File Size: 335,28 KB

Share Document on Facebook

Similar Documents

Routing algorithms / Network flow / Network theory / Shortest path problem / Routing / Maximum flow problem / Floyd–Warshall algorithm / Graph / Network topology / Graph theory / Mathematics / Theoretical computer science

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

DocID: 1gm8d - View Document

Data analysis / Network theory / Elicitation / Prediction / Data mining / Floyd–Warshall algorithm / Shortest path problem / Research / Algorithm / Mathematics / Theoretical computer science / Applied mathematics

Outcome and variable prediction for discrete processes A framework for finding answers to business questions using (process) data Master Thesis of Sjoerd van der Spoel

DocID: 19L4n - View Document

Matrix theory / Numerical linear algebra / Matrix / Shortest path problem / Floyd–Warshall algorithm / Randomized algorithm / Mathematics / Algebra / Linear algebra

Subcubic Equivalences Between Path, Matrix, and Triangle Problems∗ Virginia Vassilevska Williams† Ryan Williams‡

DocID: 18uIp - View Document

Tree decomposition / Interval graph / Floyd–Warshall algorithm / Neighbourhood / Clique / Split graph / Shortest path problem / Path decomposition / Degeneracy / Graph theory / Graph operations / Chordal graph

Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth

DocID: 18t59 - View Document

Routing algorithms / Network flow / Network theory / Shortest path problem / Routing / Maximum flow problem / Floyd–Warshall algorithm / Graph / Network topology / Graph theory / Mathematics / Theoretical computer science

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

DocID: 17YFQ - View Document