📄 http:^^www.cs.wm.edu^~wm^papers.html
字号:
Date: Wed, 15 Jan 1997 01:07:28 GMTServer: NCSA/1.4.1Content-type: text/htmlLast-modified: Wed, 04 Dec 1996 17:39:12 GMTContent-length: 3814<Title>Publications</Title><BODY background="bg.gif"><H1>Publications</H1><p><HR size="5"><p><b><!WA0><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao, A Parallel Multi-Operation Scheduling Problemwith Machine Order Constraints, <i> Proceedings of theTwelfth ACM Symposium on Applied Computing</i>, to appear.<p><!WA1><IMG src="http://www.cs.wm.edu/~wm/ball.gif">D. M. Nicol and W. Mao, On Bottleneck Partitioning of k-ary n-cubes,<i> Parallel Processing Letters</i>, Vol. 6, 389--399 (1996).<p><!WA2><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and D. M. Nicol, Parallel Multidisciplinary Design Optimization,<i> Proceedings of the Eighth IASTED-ISMM International Conferenceon Parallel and Distributed Computing and Systems</i>, 91--93 (1996).<p><!WA3><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and D. M. Nicol, Isomorphic Routing on aToroidal Mesh, <i>ORSA Journal on Computing</i>, Vol. 8, 63--73 (1996).<p><!WA4><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and R. K. Kincaid, An Analysis of Service Schedulesfor the Mobile k-Server Problem, <i>Location Science</i>, Vol. 3,107--124 (1995).<p><!WA5><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and D. M. Nicol, A Heuristic for PartitioningParallel Computation, <i> Proceedings of the Seventh IASTED-ISMMInternational Conference on Parallel and Distributed Computing and Systems</i>,295--297 (1995).<p><!WA6><IMG src="http://www.cs.wm.edu/~wm/ball.gif">D. M. Nicol and W. Mao, Automated Parallelization ofTimed Petri-Net Simulation, <i>Journal of Parallel andDistributed Computing</i>, Vol. 29, 60--74 (1995).<p><!WA7><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and R. Simha, On Compressing Databases Using Multi-FieldPattern Matching, <i>Proceedings of the International Symposium onKnowledge Retrieval, Use, and Storage for Efficiency</i>, 199--203 (1995).<p><!WA8><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and D. M. Nicol, Combinatorics of k-ary n-cubeswith Application to Partitioning,<i>Proceedings of the Fourth International Conference for YoungComputer Scientists</i>, 662--669 (1995).<p><!WA9><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao, Multi-Operation Multi-Machine Scheduling,<i>Proceedings of the 1995 International Conference andExhibition on High-Performance Computing and Networking</i>,Lecture Notes in Computer Science, Springer Verlag, Vol. 919, 33--38 (1995).<p><!WA10><IMG src="http://www.cs.wm.edu/~wm/ball.gif">H. Choi, H.-A. Choi, W. Mao, and R. Simha,Bicolored Shortest Paths in Graphs with Applications to NetworkOverlay Design, <i>Proceedings of the 1995 Conference onInformation Sciences and Systems</i>, 731--736 (1995).<p><!WA11><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao, R. K. Kincaid and A. Rifkin, On-line Single Machine SchedulingAlgorithms, Chapter 8 in <i>The Impact of Emerging Technologies on ComputerScience and Operations Research</i>, edited by S. Nash and A. Sofer,Kluwer Academic Publishers, 157--173 (1995).<p><!WA12><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and R. K. Kincaid, A Look-Ahead Heuristic for Scheduling Jobs with Release Dates on a Single Machine,<i>Computers and Operations Research</i>, Vol. 21, No. 10,1041--1050 (1994).<p><!WA13><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao and R. Simha, Routing and Scheduling File Transfers inPacket-Switched Networks, <i>Journal of Computing and Information</i>,Vol. 1, No. 1, Special Issue: Proceedings of the 6th InternationalConference on Computing and Information, 559--574 (1994).<p><!WA14><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao, Some New Results on Liu's Conjecture,<i>Proceedings of the 32nd ACM Southeast Conference</i>, 63--68 (1994).<p><!WA15><IMG src="http://www.cs.wm.edu/~wm/ball.gif"><b>W. Mao</b>, Tight Worst-Case Performance Bounds of Next-k-FitAlgorithm for Bin Packing, <i>SIAM Journal on Computing</i>,Vol. 22, No. 1, 46--56 (1993).<p><!WA16><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao, Best-k-Fit Bin Packing, <i>Computing</i>,Vol. 50, No. 3, 265--270 (1993).<p><!WA17><IMG src="http://www.cs.wm.edu/~wm/ball.gif">W. Mao, Directed File Transfer Scheduling,<i>Proceedings of the 31st ACM Southeast Conference</i>,199--203 (1993).<p><HR size="5"><p><!WA18><a href="http://www.cs.wm.edu/~wm/mao.html">Back to Mao's home page</a>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -