PROBABILISTIC ANALYSIS OF OPTIMUM PARTITIONING

被引：41

作者：

KARMARKAR, N

KARP, RM

LUEKER, GS

ODLYZKO, AM

机构：

[1] UNIV CALIF BERKELEY,DEPT ELECT ENGN & COMP SCI,BERKELEY,CA 94720

[2] UNIV CALIF IRVINE,DEPT INFORMAT & COMP SCI,IRVINE,CA 92717

来源：

JOURNAL OF APPLIED PROBABILITY | 1986年 / 23卷 / 03期

关键词：

D O I：

10.2307/3214002

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：626 / 645

页数：20

共 20 条

[1]

BILLARD P, 1965, ANN SCI ECOLE NORM S, V82, P131

[2]

Boxma O. J., 1984, PERFORMANCE '84: Models of Computer System Performance. Proceedings of the Tenth International Symposium, P475

[3]

BRUNO JL, 1982, TR8219 U AR DEP COMP

[4]

Coffman E. G. Jr., 1984, PERFORMANCE '84: Models of Computer System Performance. Proceedings of the Tenth International Symposium, P491

[5] A NOTE ON EXPECTED MAKESPANS FOR LARGEST-1ST SEQUENCES OF INDEPENDENT TASKS ON 2 PROCESSORS [J].

COFFMAN, EG ;

FREDERICKSON, GN ;

LUEKER, GS .

MATHEMATICS OF OPERATIONS RESEARCH, 1984, 9 (02) :260-266

[6] PROBABILISTIC ANALYSIS OF THE SUBSET SUM PROBLEM [J].

DATRI, G ;

PUECH, C .

DISCRETE APPLIED MATHEMATICS, 1982, 4 (04) :329-334

[7]

Erdos P., 1974, PROBABILISTIC METHOD

[8]

Feller W., 2008, INTRO PROBABILITY TH

[9]

FRENK JBG, 1984, 161084 ER U EC I WOR

[10]

FRENK JBG, 1983, ASYMPTOTIC OPTIMALIT

← 1 2 →