Fast Multi-Dimension Multi-Choice Knapsack Heuristic for MP-SoC Run-Time Management
暂无分享,去创建一个
[1] Francky Catthoor,et al. Pareto-optimization-based run-time task scheduling for embedded systems , 2003, First IEEE/ACM/IFIP International Conference on Hardware/ Software Codesign and Systems Synthesis (IEEE Cat. No.03TH8721).
[2] Thomas Bäck,et al. The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.
[3] Kin F. Li,et al. Solving the Knapsack Problem for Adaptive Multimedia Systems , 2002, Stud. Inform. Univ..
[4] Nikitas J. Dimopoulos,et al. A new heuristic for solving the multichoice multidimensional knapsack problem , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[5] Carl Staelin,et al. lmbench: Portable Tools for Performance Analysis , 1996, USENIX Annual Technical Conference.
[6] Stefan Voß,et al. Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..
[7] Liesbet Van der Perre,et al. Optimal fixed and scalable energy management for wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[8] Daniel Mossé,et al. Power-optimized scheduling server for real-time tasks , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.
[9] Ronald D. Armstrong,et al. A computational study of a multiple-choice knapsack algorithm , 1983, TOMS.
[10] Chantal Ykman-Couvreur,et al. Pareto-Based Application Specification for MP-SoC Customized Run-Time Management , 2006, 2006 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation.
[11] H. Corporaal,et al. Design-Time Application Exploration for MP-SoC Customized Run-Time Management , 2005, 2005 International Symposium on System-on-Chip.
[12] M. Moser,et al. An Algorithm for the Multidimensional Multiple-Choice Knapsack Problem , 1997 .
[13] Andreas Drexl,et al. A simulated annealing approach to the multiconstraint zero-one knapsack problem , 1988, Computing.
[14] P. Kolesar. A Branch and Bound Algorithm for the Knapsack Problem , 1967 .
[15] Mohammad Sohel Rahman,et al. Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls , 2006, Comput. Oper. Res..