Sciweavers

AAIM
2006
Springer
97views Algorithms» more  AAIM 2006»
13 years 9 months ago
Note on an Auction Procedure for a Matching Game in Polynomial Time
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...
Winfried Hochstättler, Hui Jin 0002, Robert N...
CLUSTER
2007
IEEE
13 years 10 months ago
A Comparison of robustness metrics for scheduling DAGs on heterogeneous systems
— A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led ...
Louis-Claude Canon, Emmanuel Jeannot