Pages that link to "Item:Q2875072"
From MaRDI portal
The following pages link to Coverage problems in sensor networks (Q2875072):
Displaying 15 items.
- Initializing sensor networks of non-uniform density in the weak sensor model (Q494934) (← links)
- An exact approach to extend network lifetime in a general class of wireless sensor networks (Q781952) (← links)
- Sensor network sensing coverage optimization with improved artificial bee colony algorithm using teaching strategy (Q2047515) (← links)
- Lattice coverage of cuboid with minimum number of hemispheres (Q2103797) (← links)
- An efficient genetic algorithm for maximizing area coverage in wireless sensor networks (Q2215146) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- A unified solving approach for two and three dimensional coverage problems in sensor networks (Q2629914) (← links)
- Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane (Q2680855) (← links)
- Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments (Q3381981) (← links)
- On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Circles of equal radii randomly placed on a plane: some rigorous results, asymptotic behavior, and application to transparent electrodes (Q5135078) (← links)
- A Multi-level Optimization Approach for the Planning of Heterogeneous Sensor Networks (Q5357752) (← links)
- Minimum shared‐power edge cut (Q6066053) (← links)
- Approximation algorithms for maximum weighted target cover problem with distance limitations (Q6571268) (← links)
