메뉴 건너뛰기




Volumn , Issue , 2009, Pages 917-922

A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management

Author keywords

CMP run time management; MMKP; Pareto algebra

Indexed keywords

COMPUTER AIDED DESIGN; ECONOMIC AND SOCIAL EFFECTS; ENERGY UTILIZATION;

EID: 70350707903     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1629911.1630147     Document Type: Conference Paper
Times cited : (49)

References (12)
  • 1
    • 26444509453 scopus 로고    scopus 로고
    • Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
    • M. Akbar et al. Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Computers and Operations Research, 33(5):1259-1273, 2006.
    • (2006) Computers and Operations Research , vol.33 , Issue.5 , pp. 1259-1273
    • Akbar, M.1
  • 2
    • 34547268573 scopus 로고    scopus 로고
    • An algebra of Pareto points
    • M. Geilen et al. An algebra of Pareto points. Fundamenta Informaticae, 78(1):35-74, 2007.
    • (2007) Fundamenta Informaticae , vol.78 , Issue.1 , pp. 35-74
    • Geilen, M.1
  • 3
    • 57949095480 scopus 로고    scopus 로고
    • Application Scenarios in Streaming-Oriented Embedded-System Design
    • S.V. Gheorghita et al. Application Scenarios in Streaming-Oriented Embedded-System Design. IEEE Design and Test of Computers, 25(6):581-589, 2008.
    • (2008) IEEE Design and Test of Computers , vol.25 , Issue.6 , pp. 581-589
    • Gheorghita, S.V.1
  • 4
    • 85077800039 scopus 로고    scopus 로고
    • The utility model for adaptive multimedia systems
    • S. Khan et al. The utility model for adaptive multimedia systems. Int. Workshop on Multimedia Modeling, p. 111-126, 1997.
    • (1997) Int. Workshop on Multimedia Modeling , pp. 111-126
    • Khan, S.1
  • 5
    • 1442343801 scopus 로고    scopus 로고
    • Solving the knapsack problem for adaptive multimedia systems
    • S. Khan et al. Solving the knapsack problem for adaptive multimedia systems. Studia Informatica Universalis, p. 161-182, 2002.
    • (2002) Studia Informatica Universalis , pp. 161-182
    • Khan, S.1
  • 6
    • 85028822975 scopus 로고
    • The zero/one multiple knapsack problem and genetic algorithms
    • S. Khuri et al. The zero/one multiple knapsack problem and genetic algorithms. ACM Symp. of applied computation, 1994.
    • (1994) ACM Symp. of applied computation
    • Khuri, S.1
  • 7
    • 70350718173 scopus 로고    scopus 로고
    • Lp-solve. http://lpsolve.sourceforge.net.
    • Lp-solve
  • 8
    • 0031097714 scopus 로고    scopus 로고
    • An algorithm for the multidimensional multiple-choice knapsack problem
    • E80-A(3):582-589
    • M. Moser et al. An algorithm for the multidimensional multiple-choice knapsack problem. IEICE Trans. on Fundamentals of Electronics, E80-A(3):582-589, 1997.
    • (1997) IEICE Trans. on Fundamentals of Electronics
    • Moser, M.1
  • 9
    • 70350736793 scopus 로고    scopus 로고
    • MMKP Problems. ftp://cermsem.univparisl.fr/pub/CERMSEM/hifi/MMKP/MMKP. html.
    • MMKP Problems. ftp://cermsem.univparisl.fr/pub/CERMSEM/hifi/MMKP/MMKP. html.
  • 10
    • 27144506276 scopus 로고    scopus 로고
    • A new heuristic for solving the multichoice multidimensional knapsack problem
    • R. Parra-Hemandez and N. Dimopoulos. A new heuristic for solving the multichoice multidimensional knapsack problem. IEEE Trans. on Systems, Man, Cybernetics, 35(5):708-717, 2005.
    • (2005) IEEE Trans. on Systems, Man, Cybernetics , vol.35 , Issue.5 , pp. 708-717
    • Parra-Hemandez, R.1    Dimopoulos, N.2
  • 11
    • 70350708837 scopus 로고    scopus 로고
    • SimIt-ARM. http://simit-arm.sourceforge.net.
    • SimIt-ARM
  • 12
    • 70350742113 scopus 로고    scopus 로고
    • Fast Multi-Dimension Multi-Choice Knapsack Heuristic for MP-SoC Run-Time Management. In SoC
    • Ch. Ykman-Couvreur et al. Fast Multi-Dimension Multi-Choice Knapsack Heuristic for MP-SoC Run-Time Management. In SoC 2006, p. 1-4. IEEE, 2006.
    • (2006) 1-4. IEEE , pp. 2006
    • Ykman-Couvreur, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.