Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Computing Course Materials >
Fundamentals of Algorithms >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1307

Title: Dynamic Programming
Authors: Choueiry, Berthe
Keywords: ACMCCS98::Computing Methodologies::ARTIFICIAL INTELLIGENCE::Problem Solving, Control Methods, and Search::Dynamic programming
ACMCCS98::Computing Methodologies::SYMBOLIC AND ALGEBRAIC MANIPULATION::Algorithms::Analysis of algorithms
Issue Date: 2007
Abstract: Solves problems by combining solutions to sub problems.
Description: Divide and Conquer technique is one of the best examples for Dynamic Programming.
URI: http://www.citidel.org/handle/10117/1307
Appears in Collections:Fundamentals of Algorithms

Files in This Item:

File Description SizeFormat
DynamicProgramming.pdf408KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback