Date: Wed, 15 Jan 1997 01:07:28 GMT Server: NCSA/1.4.1 Content-type: text/html Last-modified: Wed, 04 Dec 1996 17:39:12 GMT Content-length: 3814 Publications

Publications


W. Mao, A Parallel Multi-Operation Scheduling Problem with Machine Order Constraints, Proceedings of the Twelfth ACM Symposium on Applied Computing, to appear.

D. M. Nicol and W. Mao, On Bottleneck Partitioning of k-ary n-cubes, Parallel Processing Letters, Vol. 6, 389--399 (1996).

W. Mao and D. M. Nicol, Parallel Multidisciplinary Design Optimization, Proceedings of the Eighth IASTED-ISMM International Conference on Parallel and Distributed Computing and Systems, 91--93 (1996).

W. Mao and D. M. Nicol, Isomorphic Routing on a Toroidal Mesh, ORSA Journal on Computing, Vol. 8, 63--73 (1996).

W. Mao and R. K. Kincaid, An Analysis of Service Schedules for the Mobile k-Server Problem, Location Science, Vol. 3, 107--124 (1995).

W. Mao and D. M. Nicol, A Heuristic for Partitioning Parallel Computation, Proceedings of the Seventh IASTED-ISMM International Conference on Parallel and Distributed Computing and Systems, 295--297 (1995).

D. M. Nicol and W. Mao, Automated Parallelization of Timed Petri-Net Simulation, Journal of Parallel and Distributed Computing, Vol. 29, 60--74 (1995).

W. Mao and R. Simha, On Compressing Databases Using Multi-Field Pattern Matching, Proceedings of the International Symposium on Knowledge Retrieval, Use, and Storage for Efficiency, 199--203 (1995).

W. Mao and D. M. Nicol, Combinatorics of k-ary n-cubes with Application to Partitioning, Proceedings of the Fourth International Conference for Young Computer Scientists, 662--669 (1995).

W. Mao, Multi-Operation Multi-Machine Scheduling, Proceedings of the 1995 International Conference and Exhibition on High-Performance Computing and Networking, Lecture Notes in Computer Science, Springer Verlag, Vol. 919, 33--38 (1995).

H. Choi, H.-A. Choi, W. Mao, and R. Simha, Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design, Proceedings of the 1995 Conference on Information Sciences and Systems, 731--736 (1995).

W. Mao, R. K. Kincaid and A. Rifkin, On-line Single Machine Scheduling Algorithms, Chapter 8 in The Impact of Emerging Technologies on Computer Science and Operations Research, edited by S. Nash and A. Sofer, Kluwer Academic Publishers, 157--173 (1995).

W. Mao and R. K. Kincaid, A Look-Ahead Heuristic for Scheduling Jobs with Release Dates on a Single Machine, Computers and Operations Research, Vol. 21, No. 10, 1041--1050 (1994).

W. Mao and R. Simha, Routing and Scheduling File Transfers in Packet-Switched Networks, Journal of Computing and Information, Vol. 1, No. 1, Special Issue: Proceedings of the 6th International Conference on Computing and Information, 559--574 (1994).

W. Mao, Some New Results on Liu's Conjecture, Proceedings of the 32nd ACM Southeast Conference, 63--68 (1994).

W. Mao, Tight Worst-Case Performance Bounds of Next-k-Fit Algorithm for Bin Packing, SIAM Journal on Computing, Vol. 22, No. 1, 46--56 (1993).

W. Mao, Best-k-Fit Bin Packing, Computing, Vol. 50, No. 3, 265--270 (1993).

W. Mao, Directed File Transfer Scheduling, Proceedings of the 31st ACM Southeast Conference, 199--203 (1993).


Back to Mao's home page