AAAAAA

   
Results: 1-13 |
Results: 13
MINIMIZING MEAN FLOW TIME WITH ERROR CONSTRAINT
Authors: LEUNG JYT TAM TW WONG CS YOUNG GH
Citation: Jyt. Leung et al., MINIMIZING MEAN FLOW TIME WITH ERROR CONSTRAINT, Algorithmica, 20(1), 1998, pp. 101-118
SCHEDULING IMPRECISE COMPUTATION TASKS WITH 0 1-CONSTRAINT/
Authors: HO KIJ LEUNG JYT WEI WD
Citation: Kij. Ho et al., SCHEDULING IMPRECISE COMPUTATION TASKS WITH 0 1-CONSTRAINT/, Discrete applied mathematics, 78(1-3), 1997, pp. 117-132
ONLINE ROUTING OF REAL-TIME MESSAGES
Authors: LEUNG JYT TAM TW YOUNG GH
Citation: Jyt. Leung et al., ONLINE ROUTING OF REAL-TIME MESSAGES, Journal of parallel and distributed computing, 34(2), 1996, pp. 211-217
PROBABILISTIC ANALYSIS OF A BIN COVERING ALGORITHM
Authors: HAN SN HONG DW LEUNG JYT
Citation: Sn. Han et al., PROBABILISTIC ANALYSIS OF A BIN COVERING ALGORITHM, Operations research letters, 18(4), 1996, pp. 193-199
A COMPARISON THEOREM FOR PERMANENTS AND A PROOF OF A CONJECTURE ON (T,M)-FAMILIES (VOL 61, PG 98, 1992)
Authors: LEUNG JYT WEI WD
Citation: Jyt. Leung et Wd. Wei, A COMPARISON THEOREM FOR PERMANENTS AND A PROOF OF A CONJECTURE ON (T,M)-FAMILIES (VOL 61, PG 98, 1992), J COMB TH A, 73(1), 1996, pp. 190-192
ROUTING MESSAGES WITH RELEASE TIME AND DEADLINE CONSTRAINTS
Authors: LEUNG JYT TAM TW WONG CS YOUNG GH
Citation: Jyt. Leung et al., ROUTING MESSAGES WITH RELEASE TIME AND DEADLINE CONSTRAINTS, Journal of parallel and distributed computing, 31(1), 1995, pp. 65-76
TIGHTER BOUNDS ON A HEURISTIC FOR A PARTITION PROBLEM
Authors: LEUNG JYT WEI WD
Citation: Jyt. Leung et Wd. Wei, TIGHTER BOUNDS ON A HEURISTIC FOR A PARTITION PROBLEM, Information processing letters, 56(1), 1995, pp. 51-57
PROBABILISTIC ANALYSIS OF K-DIMENSIONAL PACKING ALGORITHMS
Authors: HONG DW LEUNG JYT
Citation: Dw. Hong et Jyt. Leung, PROBABILISTIC ANALYSIS OF K-DIMENSIONAL PACKING ALGORITHMS, Information processing letters, 55(1), 1995, pp. 17-24
MINIMIZING THE WEIGHTED NUMBER OF TARDY TASK UNITS
Authors: LEUNG JYT YU VKM WEI WD
Citation: Jyt. Leung et al., MINIMIZING THE WEIGHTED NUMBER OF TARDY TASK UNITS, Discrete applied mathematics, 51(3), 1994, pp. 307-316
ON MULTIDIMENSIONAL PACKET ROUTING FOR MESHES WITH BUSES
Authors: LEUNG JYT SHENDE SM
Citation: Jyt. Leung et Sm. Shende, ON MULTIDIMENSIONAL PACKET ROUTING FOR MESHES WITH BUSES, Journal of parallel and distributed computing, 20(2), 1994, pp. 187-197
MINIMIZING MAXIMUM WEIGHTED ERROR FOR IMPRECISE COMPUTATION TASKS
Authors: HO KIJ LEUNG JYT WEI WD
Citation: Kij. Ho et al., MINIMIZING MAXIMUM WEIGHTED ERROR FOR IMPRECISE COMPUTATION TASKS, Journal of algorithms, 16(3), 1994, pp. 431-452
MINIMIZING THE NUMBER OF LATE TASKS WITH ERROR CONSTRAINT
Authors: LEUNG JYT WONG CS
Citation: Jyt. Leung et Cs. Wong, MINIMIZING THE NUMBER OF LATE TASKS WITH ERROR CONSTRAINT, Information and computation, 106(1), 1993, pp. 83-108
COMPLEXITY OF SCHEDULING TASKS WITH TIME-DEPENDENT EXECUTION TIMES
Authors: HO KIJ LEUNG JYT WEI WD
Citation: Kij. Ho et al., COMPLEXITY OF SCHEDULING TASKS WITH TIME-DEPENDENT EXECUTION TIMES, Information processing letters, 48(6), 1993, pp. 315-320
Risultati: 1-13 |