GreedEx---a scalable clearing mechanism for utility computing
From MaRDI portal
Publication:1020573
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1946761 (Why is no real title available?)
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- Predicting application run times with historical information
- Project Scheduling Under Partially Renewable Resource Constraints
- Trading grid services - a multi-attribute combinatorial approach
- Truth revelation in approximately efficient combinatorial auctions
This page was built for publication: GreedEx---a scalable clearing mechanism for utility computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1020573)