AAAAAA

   
Results: 1-11 |
Results: 11
PROBLEMS WITH COMPARING INTERCONNECTION NETWORKS - IS AN ALLIGATOR BETTER THAN AN ARMADILLO
Authors: LISZKA KJ ANTONIO JK SIEGEL HJ
Citation: Kj. Liszka et al., PROBLEMS WITH COMPARING INTERCONNECTION NETWORKS - IS AN ALLIGATOR BETTER THAN AN ARMADILLO, IEEE concurrency, 5(4), 1997, pp. 18
MINIMIZING THE APPLICATION EXECUTION TIME THROUGH SCHEDULING OF SUBTASKS AND COMMUNICATION TRAFFIC IN A HETEROGENEOUS COMPUTING SYSTEM
Authors: TAN M SIEGEL HJ ANTONIO JK LI YA
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
FAST SOLUTION TECHNIQUES FOR A CLASS OF OPTIMAL TRAJECTORY PLANNING PROBLEMS WITH APPLICATIONS TO AUTOMATED SPRAY COATING
Authors: RAMABHADRAN R ANTONIO JK
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
A FRAMEWORK FOR OPTIMAL TRAJECTORY PLANNING FOR AUTOMATED SPRAY COATING
Authors: ANTONIO JK RAMABHADRAN R LING TL
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
DETERMINING THE EXECUTION TIME DISTRIBUTION FOR A DATA-PARALLEL PROGRAM IN A HETEROGENEOUS COMPUTING ENVIRONMENT
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
WHAT WILL IT TAKE TO SELL A MASSIVE NUMBER OF MASSIVELY-PARALLEL MACHINES
Authors: SIEGEL HJ WATSON DW ANTONIO JK
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
CONCURRENT COMMUNICATION IN HIGH-SPEED WIDE AREA NETWORKS
Authors: ANTONIO JK
Citation: Jk. Antonio, CONCURRENT COMMUNICATION IN HIGH-SPEED WIDE AREA NETWORKS, IEEE transactions on parallel and distributed systems, 5(3), 1994, pp. 264-273
A BLOCK-BASED MODE SELECTION MODEL FOR SIMD SPMD PARALLEL ENVIRONMENTS/
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
TIME-COMPLEXITY OF A PATH FORMULATED OPTIMAL ROUTING ALGORITHM (2ND PRINTING)
Authors: ANTONIO JK TSAI WK HUANG GM
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
TIME-COMPLEXITY OF A PATH FORMULATED OPTIMAL ROUTING ALGORITHM
Authors: ANTONIO JK TSAI WK HUANG GM
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
HYPERSPHERE MAPPER - A NONLINEAR-PROGRAMMING APPROACH TO THE HYPERCUBE EMBEDDING PROBLEM
Authors: ANTONIO JK METZGER RC
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
Risultati: 1-11 |