( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
ShareEnergy: Configuring Mobile Relays to Extend Sensor Networks Lifetime Based on Residual Power.

, , , , , и . CTS, стр. 478-484. IEEE Computer Society, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Tsong-Sheng Tsan

Tung-sheng Sheng

Tung-sheng Sheng

Tung-sheng Sheng

Tung-sheng Sheng

 

Другие публикации лиц с тем же именем

BASE: an assistant tool to precisely simulate energy consumption and reliability of energy-efficient storage systems., , и . Softw. Pract. Exp., 46 (5): 581-599 (2016)Changing of Spreading Dynamics for Infectious Diseases in an Aging Society: A Simulation Case Study on Flu Pandemic., , , , , , и . SIMULTECH, стр. 453-460. SCITEPRESS, (2021)Value versus damage of information release: A data privacy perspective., , , и . Int. J. Approx. Reason., 43 (2): 179-201 (2006)The bridge-connectivity augmentation problem with a partition constraint., , , , и . Theor. Comput. Sci., 411 (31-33): 2878-2889 (2010)Knowledge Inferencing on Chinese Chess Endgames., , , и . Computers and Games, том 5131 из Lecture Notes in Computer Science, стр. 180-191. Springer, (2008)Graph Searching on Chordal Graphs., , , , и . ISAAC, том 1178 из Lecture Notes in Computer Science, стр. 156-165. Springer, (1996)Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)., , , , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 1195-1204. Springer, (2009)Executing Divisible Jobs on a Network with a Fixed Number of Processors., и . COCOON, том 1449 из Lecture Notes in Computer Science, стр. 241-250. Springer, (1998)Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications., и . COCOON, том 1090 из Lecture Notes in Computer Science, стр. 169-178. Springer, (1996)Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess., , и . CIG, стр. 260-266. IEEE, (2015)