<--- 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

AN SDP-BASED DIVIDE-AND-CONQUER ALGORITHM FOR LARGE SCALE NOISY ANCHOR-FREE GRAPH REALIZATION NGAI-HANG Z. LEUNG ∗ AND

DocID: 1u0vN - View Document

Cache / Computer architecture / Computing / Analysis of algorithms / Models of computation / Computer science / Computer engineering / Cache-oblivious algorithm / Computer memory / Memory hierarchy / Divide and conquer algorithms / CPU cache

Lecture 8: The Cache Oblivious Approach www.cs.illinois.edu/~wgropp Designing for Memory Hierarchy

DocID: 1rpNE - View Document

Computer programming / Mathematics / Applied mathematics / Theoretical computer science / Sorting algorithms / Operations research / Analysis of algorithms / Merge sort / Divide and conquer algorithms / Algorithm / Recursion / Time complexity

CSE 181 Project guidelines

DocID: 1rn8e - View Document

Mathematics / Algorithms / Applied mathematics / Analysis of algorithms / Cache / Models of computation / Computer science / Sorting algorithms / Cache-oblivious algorithm / Divide and conquer algorithms / Matching / In-place algorithm

Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Michal Vaner

DocID: 1r4Mz - View Document

Operations research / Mathematics / Applied mathematics / Mathematical optimization / Dynamic programming / Divide and conquer algorithms / Algorithm / Recursion / Optimal substructure / Linear programming relaxation

. CS711008Z Algorithm Design and Analysis Lecture 6. Basic algorithm design technique: Dynamic programming 1

DocID: 1qGbv - View Document