Pages that link to "Item:Q1128739"
From MaRDI portal
The following pages link to Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739):
Displaying 3 items.
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time (Q687632) (← links)
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time (Q1322507) (← links)
- Finding quadratic schedules for affine recurrence equations via nonsmooth optimization (Q1584052) (← links)