Citation: Kj. Liszka et al., PROBLEMS WITH COMPARING INTERCONNECTION NETWORKS - IS AN ALLIGATOR BETTER THAN AN ARMADILLO, IEEE concurrency, 5(4), 1997, pp. 18
Citation: M. Tan et al., MINIMIZING THE APPLICATION EXECUTION TIME THROUGH SCHEDULING OF SUBTASKS AND COMMUNICATION TRAFFIC IN A HETEROGENEOUS COMPUTING SYSTEM, IEEE transactions on parallel and distributed systems, 8(8), 1997, pp. 857-871
Citation: R. Ramabhadran et Jk. Antonio, FAST SOLUTION TECHNIQUES FOR A CLASS OF OPTIMAL TRAJECTORY PLANNING PROBLEMS WITH APPLICATIONS TO AUTOMATED SPRAY COATING, IEEE transactions on robotics and automation, 13(4), 1997, pp. 519-530
Citation: Jk. Antonio et al., A FRAMEWORK FOR OPTIMAL TRAJECTORY PLANNING FOR AUTOMATED SPRAY COATING, International journal of robotics & automation, 12(4), 1997, pp. 124-134
Authors:
LI YA
ANTONIO JK
SIEGEL HJ
TAN M
WATSON DW
Citation: Ya. Li et al., DETERMINING THE EXECUTION TIME DISTRIBUTION FOR A DATA-PARALLEL PROGRAM IN A HETEROGENEOUS COMPUTING ENVIRONMENT, Journal of parallel and distributed computing, 44(1), 1997, pp. 35-52
Citation: Hj. Siegel et al., WHAT WILL IT TAKE TO SELL A MASSIVE NUMBER OF MASSIVELY-PARALLEL MACHINES, IEEE parallel & distributed technology, 4(3), 1996, pp. 63-69
Citation: Jk. Antonio, CONCURRENT COMMUNICATION IN HIGH-SPEED WIDE AREA NETWORKS, IEEE transactions on parallel and distributed systems, 5(3), 1994, pp. 264-273
Authors:
WATSON DW
SIEGEL HJ
ANTONIO JK
NICHOLS MA
ATALLAH MJ
Citation: Dw. Watson et al., A BLOCK-BASED MODE SELECTION MODEL FOR SIMD SPMD PARALLEL ENVIRONMENTS/, Journal of parallel and distributed computing, 21(3), 1994, pp. 271-288
Citation: Jk. Antonio et al., TIME-COMPLEXITY OF A PATH FORMULATED OPTIMAL ROUTING ALGORITHM (2ND PRINTING), IEEE transactions on automatic control, 39(9), 1994, pp. 1839-1844
Citation: Jk. Antonio et al., TIME-COMPLEXITY OF A PATH FORMULATED OPTIMAL ROUTING ALGORITHM, IEEE transactions on automatic control, 39(2), 1994, pp. 385-391
Citation: Jk. Antonio et Rc. Metzger, HYPERSPHERE MAPPER - A NONLINEAR-PROGRAMMING APPROACH TO THE HYPERCUBE EMBEDDING PROBLEM, Journal of parallel and distributed computing, 19(3), 1993, pp. 262-270