A Simulated Annealing Algorithm for the Target Coverage Problem in Wireless Sensor Networks
碩士 === 國立雲林科技大學 === 電機工程系 === 103 === The target coverage problem in wireless sensor networks has been proven to be an NP-complete problem. As a problem has been proven to be NP-complete, it is important and practical to design its heuristic algorithms. Actually, several heuristic algorithms have be...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98770043286267646613 |