최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기電子工學會論文誌. Journal of the Institute of Electronics Engineers of Korea. TC, 통신, v.44 no.8 = no.362, 2007년, pp.62 - 67
In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its form in literature: the Minimum number of Steiner P...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
S. Meguerdichian, F. Koushanfar, M. Potkonjak and M. B. Srivastava, 'Coverage Problems in Wireless Ad-hoc Sensor Networks,' Proc. IEEE INFOCOM, vol.3, pp.22-26, 2001
S. S. Dhillon and K. Chakrabarty, 'Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks,' Proc. IEEE Wireless Communications and Networking Conference, pp.1609-1614, 2003
http://enl.usc.edu/~ningxu/papers/survey.pdf
G.-H. Lin and G.L. Xue, 'Steiner tree problem with minimum number of Steiner points and bounded edge-length,' Information Processing Letters, vol.69, pp.53-57, 1999
F. K. Hwang, D. S. Richards and P. Winter, 'The Steiner Tree Problem,' Annals of Discrete Mathematics, North-Holland, vol.53, 1992
D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang and G. Xue, 'Approximations for Steiner trees with minimum number of Steiner points,' Theoretical Computer Science, vol.262, pp.83-99, 2001
S. Arora, 'Polynomial-time approximation schemes for Euclidean TSP and other geometric problems,' Proc. 37th IEEE Symp. on Foundations of Computer Science, pp.2-12, 1996
※ AI-Helper는 부적절한 답변을 할 수 있습니다.