<--- Back to Details
First PageDocument Content
Operations research / Theoretical computer science / Mathematical optimization / Algorithm / Mathematical logic / Recurrence relations / Divide and conquer algorithm / Dynamic programming / Greedy algorithm / Mathematics / Mathematical analysis / Applied mathematics
Date: 2007-11-06 12:31:10
Operations research
Theoretical computer science
Mathematical optimization
Algorithm
Mathematical logic
Recurrence relations
Divide and conquer algorithm
Dynamic programming
Greedy algorithm
Mathematics
Mathematical analysis
Applied mathematics

COMP2140 –Data Structures and Algorithms

Add to Reading List

Source URL: www.cs.umanitoba.ca

Download Document from Source Website

File Size: 10,88 KB

Share Document on Facebook

Similar Documents

Concurrent computing / Parallel computing / Computing / IT infrastructure / Cloud infrastructure / Job scheduling / Apache Hadoop / Apache Software Foundation / Data-intensive computing / Workflow / Algorithmic skeleton / Programming paradigm

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher

DocID: 1xTOs - View Document

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

DocID: 1vqMk - View Document

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain*

DocID: 1vouJ - View Document

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

DocID: 1vhRF - View Document

EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples

DocID: 1vg0M - View Document