http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
N-Tu-3.2: JAMMING GAMES FOR POWER CONTROLLED MEDIUM ACCESS WITH DYNAMIC TRAFFIC
Sagduyu, Y.; Berry, R.; Ephremides, A. unknown 2010 p.1818-1822
N-Tu-3.3: A CHANNEL CODING APPROACH FOR RANDOM ACCESS COMMUNICATION WITH BURSTY SOURCES
Luo, J.; Ephremides, A. unknown 2010 p.1823-1827
N-Tu-3.4: CONSTRUCTION OF SHORT PROTOCOL SEQUENCES WITH WORST-CASE THROUGHPUT GUARANTEE
Shum, K.W.; Wong, W.S. unknown 2010 p.1828-1832
N-Tu-4.1: TOWARDS OPTIMUM COST IN MULTI-HOP NETWORKS WITH ARBITRARY NETWORK DEMANDS
Viswanatha, K.; Akyol, E.; Rose, K. unknown 2010 p.1833-1837
N-Tu-4.2: COOPERATIVE RELIABILITY FOR STREAMING MULTIPLE ACCESS
Shkel, Y.; Draper, S. unknown 2010 p.1838-1842
Wang, R.; Lau, V.K.N.; Huang, H. unknown 2010 p.1843-1847
N-Tu-4.4: GEOMETRIC APPROXIMATIONS OF SOME ALOHA-LIKE STABILITY REGIONS
Xie, N.; Weber, S. unknown 2010 p.1848-1852
N-We-2.1: COMMUNICATING THE SUM OF SOURCES IN A 3-SOURCES/3-TERMINALS NETWORK; REVISITED
Langberg, M.; Ramamoorthy, A. unknown 2010 p.1853-1937
N-We-2.2: A NECESSARY AND SUFFICIENT CONDITION FOR SOLVABILITY OF A $3S/3T$ SUM-NETWORK
Shenvi, S.; Dey, B.K. unknown 2010 p.1858-1862
N-We-2.3: OPTIMAL ORDERING OF TRANSMISSIONS FOR COMPUTING BOOLEAN THRESHOLD FUNCTIONS
Kowshik, H.; Kumar, P.R. unknown 2010 p.1863-1867