| 2012 | ||
|---|---|---|
| c21 | Kai Tian, Yunlian Jiang, Xipeng Shen, Weizhen Mao: Optimal Co-Scheduling to Minimize Makespan on Chip Multiprocessors. JSSPP 2012: 114-133 | |
| i1 | Xiaojun Zhu, Qun Li, Weizhen Mao, Guihai Chen: Online Vector Scheduling and Generalized Load Balancing. CoRR abs/1211.5729 (2012) | |
| 2011 | ||
| j11 | Lei Xie, Qun Li, Weizhen Mao, Jie Wu, Daoxu Chen: Association Control for Vehicular WiFi Access: Pursuing Efficiency and Fairness. IEEE Trans. Parallel Distrib. Syst. 22(8): 1323-1331 (2011) | |
| c20 | Zhen Ren, Gang Zhou, Andrew J. Pyles, Matthew Keally, Weizhen Mao, Haining Wang: BodyT2: Throughput and time delay performance assurance for heterogeneous BSNs. INFOCOM 2011: 2750-2758 | |
| 2010 | ||
| j10 | Bo Sheng, Qun Li, Weizhen Mao: Optimize Storage Placement in Sensor Networks. IEEE Trans. Mob. Comput. 9(10): 1437-1450 (2010) | |
| c19 | Jie Chen, William A. Watson III, Weizhen Mao: GMH: A Message Passing Toolkit for GPU Clusters. ICPADS 2010: 35-42 | |
| c18 | Bo Sheng, Qun Li, Weizhen Mao: Efficient Continuous Scanning in RFID Systems. INFOCOM 2010: 1010-1018 | |
| c17 | Hao Han, Bo Sheng, Chiu Chiang Tan, Qun Li, Weizhen Mao, Sanglu Lu: Counting RFID Tags Efficiently and Anonymously. INFOCOM 2010: 1028-1036 | |
| 2009 | ||
| c16 | Lei Xie, Qun Li, Weizhen Mao, Jie Wu, Daoxu Chen: Achieving Efficiency and Fairness for Association Control in Vehicular Networks. ICNP 2009: 324-333 | |
| c15 | Yafeng Wu, Matthew Keally, Gang Zhou, Weizhen Mao: Traffic-Aware Channel Assignment in Wireless Sensor Networks. WASA 2009: 479-488 | |
| 2008 | ||
| j9 | Jessen T. Havill, Weizhen Mao: Competitive online scheduling of perfectly malleable jobs with setup times. European Journal of Operational Research 187(3): 1126-1142 (2008) | |
| c14 | Richard A. Dutton, Weizhen Mao, Jie Chen, William A. Watson III: Parallel Job Scheduling with Overhead: A Benchmark Study. NAS 2008: 326-333 | |
| c13 | Bo Sheng, Chiu Chiang Tan, Qun Li, Weizhen Mao: Finding popular categories for RFID tags. MobiHoc 2008: 159-168 | |
| 2007 | ||
| c12 | ||
| c11 | Weizhen Mao, Jie Chen, William A. Watson III: One-to-all personalized communication in torus networks. Parallel and Distributed Computing and Networks 2007: 272-277 | |
| 2006 | ||
| c10 | ||
| 2005 | ||
| c9 | Jie Chen, William A. Watson III, Robert Edwards, Weizhen Mao: Message Passing for Linux Clusters with Gigabit Ethernet Mesh Connections. IPDPS 2005 | |
| 2004 | ||
| j8 | Gianfranco Ciardo, Weizhen Mao, Alma Riska, Evgenia Smirni: ETAQA-MG1: an efficient technique for the analysis of a class of M/G/1-type processes by aggregation. Perform. Eval. 57(3): 235-260 (2004) | |
| c8 | Jie Chen, Robert Edwards, Weizhen Mao: QMP-MVIA: a message passing system for Linux clusters with gigabit Ethernet mesh connections. CLUSTER 2004: 485 | |
| 2003 | ||
| j7 | Weizhen Mao, David M. Nicol: On k-ary n-cubes: Theory and Applications. Discrete Applied Mathematics 129(1): 171-193 (2003) | |
| 2002 | ||
| c7 | ||
| c6 | ||
| 2000 | ||
| c5 | Weizhen Mao: Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling. ISPAN 2000: 292-296 | |
| 1999 | ||
| j6 | Jessen T. Havill, Weizhen Mao: Greedy online algorithms for routing permanent virtual circuits. Networks 34(2): 136-153 (1999) | |
| 1997 | ||
| c4 | ||
| c3 | Weizhen Mao: A parallel multi-operation scheduling problem with machine order constraints. SAC 1997: 473-477 | |
| 1996 | ||
| j5 | Weizhen Mao, David M. Nicol: Isomorphic Routing on a Toroidal Mesh. INFORMS Journal on Computing 8(1): 63-73 (1996) | |
| j4 | David M. Nicol, Weizhen Mao: On Bottleneck Partitioning of k-Ary n-Cubes. Parallel Processing Letters 6(3): 389-399 (1996) | |
| 1995 | ||
| j3 | David M. Nicol, Weizhen Mao: Automated Parallelization of Timed Petri-Net Simulations. J. Parallel Distrib. Comput. 29(1): 60-74 (1995) | |
| c2 | ||
| c1 | Weizhen Mao, David M. Nicol: A Heuristic for Partitioning Parallel Computation. Parallel and Distributed Computing and Systems 1995: 295-297 | |
| 1994 | ||
| j2 | Weizhen Mao, Rex K. Kincaid: A look-ahead heuristic for scheduling jobs with release dates on a single machine. Computers & OR 21(10): 1041-1050 (1994) | |
| 1993 | ||
| j1 | Weizhen Mao: Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing. SIAM J. Comput. 22(1): 46-56 (1993) | |
Colors in the list of coauthors
Last update Sun May 19 16:44:41 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page