02-greedy

Id start end 1 2 900 915 1045 1015 3 4 930 945 1230

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Prof. Bloomfield Managing Keyboard Fatigue with Swedish Massage Applied ChemE: Suntan Oil or Lotion? Optimization, Greedy Algorithms, and the Buffet Line Hydrodynamics and Surfing Computational Genetics and Infectious Diseases Turing Award Speech Karaoke Pool Tanning for Engineers Mechanics, Dynamics and Shuffleboard Physics Discrete Math Applications in Gambling Generalizing Start, End Id Start End Len Activity 1 2 0 1 6 4 3 4 2 3 13 5 5 6 7 8 9 10 11 3 5 5 6 8 8 12 8 7 9 10 11 12 14 51 7 4 Fractals, Recursion and Crayolas Tropical Drink Engineering with Prof. Bloomfield Managing Keyboard Fatigue with Swedish 12 Massage 3 Applied ChemE: Suntan Oil or Lotion? Optimization, Greedy Algorithms, and the Buffet 6 Line 3 Hydrodynamics and Surfing 5 Computational Genetics and Infectious Diseases 5 Turing Award Speech Karaoke 4 Pool Tanning for Engineers 5 Mechanics, Dynamics and Shuffleboard Physics 3 Discrete Math Applications in Gambling Greedy Approach 1. Select a first item. 2. Eliminate items that are incompatible with that item. (i.e. they overlap.) 3. Apply the greedy rule (AKA selection function) to pick the next item. 4. Go to Step 2 What is a good greedy rule for selecting the next item? 52 Some Possibilities...
View Full Document

This note was uploaded on 02/25/2014 for the course CS 4102 taught by Professor Horton during the Spring '10 term at UVA.

Ask a homework question - tutors are online