( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles.

, , , и . Wirel. Commun. Mob. Comput., 10 (5): 647-661 (2010)

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.

Humberto Luis José D' Angelo

Humberto Luis José D' Angelo

Humberto Jorge José

Luís Guilherme Barbosa Rolim

Nadine José Gonzalez

 

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

On the Parallel Computation of Boolean Functions on Unrelated inputs., , и . ISTCS, стр. 155-161. IEEE Computer Society, (1996)Energy Balance Mechanisms and Lifetime Optimization of Wireless Networks.. IC3, том 168 из Communications in Computer and Information Science, стр. 1. Springer, (2011)A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol., , , и . WEA, том 3503 из Lecture Notes in Computer Science, стр. 341-353. Springer, (2005)Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware., , и . STACS, том 1046 из Lecture Notes in Computer Science, стр. 319-330. Springer, (1996)Efficient Construction of Hitting Sets for Systems of Linear Functions., , и . STACS, том 1200 из Lecture Notes in Computer Science, стр. 387-398. Springer, (1997)Hitting Sets Derandomize BPP., , и . ICALP, том 1099 из Lecture Notes in Computer Science, стр. 357-368. Springer, (1996)E-Complete Sets Do Not Have Optimal Polynomial Time Approximations., и . MFCS, том 841 из Lecture Notes in Computer Science, стр. 38-51. Springer, (1994)Low radiation paths in wireless networks pass along Voronoi diagram., , и . SoftCOM, стр. 1-5. IEEE, (2013)A Note on the Density of Oracle Decreasing Time-Space Complexity., и . Theor. Comput. Sci., 132 (2): 435-444 (1994)Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles., , , и . Wirel. Commun. Mob. Comput., 10 (5): 647-661 (2010)