Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
123
Voted
JPDC
2006
148
views
more
JPDC 2006
»
Efficient algorithm for placing a given number of base stations to cover a convex region
15 years 2 months ago
Download
www.cs.ccu.edu.tw
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
claim paper
Read More »