Optimization_Problems_Recap

# Optimization_Problems_Recap - Assume we have an array r of...

This preview shows pages 1–10. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Initialize the matrix c to all zeros. Assume we have an array r of request records. for d=1 to n+1 for i=0 to n-d+1 j=i+d if (r[i].f<=r[j].s) for k=i+1 to j-1 if ( ((r[i].f<=r[k].s) (r[k].f<=r[j].s) ) (c[i,k]+1+c[k,j]>c[i,j]) ) then c[i,j]= c[i,k]+1+c[k,j];

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Initialize the matrix c to all zeros.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

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

Unformatted text preview: Assume we have an array r of request records. for d=1 to n+1 for i=0 to n-d+1 j=i+d if (r[i].f<=r[j].s) for k=i+1 to j-1 if ( ((r[i].f<=r[k].s) && (r[k].f<=r[j].s) ) && (c[i,k]+1+c[k,j]>c[i,j]) ) then c[i,j]= c[i,k]+1+c[k,j];...
View Full Document

{[ snackBarMessage ]}

### Page1 / 10

Optimization_Problems_Recap - Assume we have an array r of...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online