Register Now
You need to be registered to access all features and be part of the community.
Don't worry it's free !
Register Now
Lost Password
Lost your password? Please enter your username and email address. You will receive a link to create a new password via email.
Péter Englert (ChemAxon): The Next Generation of Maximum Common Substructure Search at ChemAxon :
Ratings : 54 %
8.5 - Correctness Proof 1 - Huffman Codes - [DSA 2] By Tim Roughgarden :
Ratings : 73 %
12.3 - Proof of Optimal Substructure - Optimal Binary Search Trees - [DSA 2] - By Tim Roughgarden :
Ratings : 37 %
In the game Hangman, is it the case that a greedy letter-frequency algorithm is equivalent to a best-chance-of-winning algorithm? Is there ever a case where it's
Read More
Ratings : 22 %
The activities represented by the blue lines are the optimal choice given the above schedule. But as the activity in red produces only 2 clashes, it will be chosen first.
Read More
Ratings : 57 %
Greedy Solution to the Fractional Knapsack Problem. There are n items in a store. For i =1,2,... , n, item i has weight w i > 0 and worth v i > 0.
Read More
Ratings : 28 %
This is a really general question. What is dynamic programming (how's it different from recursion, memoization, etc)? I've read the wikipedia article on it but I
Read More
Ratings : 54 %
12.2 - Optimal Substructure - Optimal Binary Search Trees - [DSA 2] - By Tim Roughgarden :
Ratings : 12 %
Cover page. The articles are in reverse-chronological order, more or less. The index, once assigned, does not change; hence some fractional indices and
Read More
Ratings : 44 %
Algorithms - Dynamic Programming - 14 - Adhocks - Optimal Substructure Analysis (Arabic) :
Ratings : 56 %
13.2 - Optimal Substructure - The Bellman-Ford Algorithm - [DSA 2] - By Tim Roughgarden :
Ratings : 58 %
Greedy algorithms: Picking largest set of non-overlapping intervals :
Ratings : 73 %
14.2 - Optimal Substructure - All-Pairs Shortest Path - [DSA 2] - By Tim Roughgarden :
Ratings : 66 %
11.1 - Optimal Substructure - Sequence Alignment - [DSA 2] - By Tim Roughgarden :
Ratings : 12 %
9.2 - WIS in Path Graphs: Optimal Substructure - Dynamic Programming - By Tim Roughgarden :
Ratings : 72 %