Pages that link to "Item:Q2266832"

The following pages link to Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks (Q2266832):

Displaying 9 items.

• A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem (Q336419) (← links)
• A near optimal periodic transmission schedule in bounded degree wireless sensor network (Q693076) (← links)
• Approximation for a scheduling problem with application in wireless networks (Q989801) (← links)
• Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks (Q2026168) (← links)
• Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks (Q2267270) (← links)
• Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks† (Q3437345) (← links)
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm (Q6082271) (← links)
• Scheduling sensors by tiling lattices (Q6483538) (← links)
• Strong bounds and exact solutions to the minimum broadcast time problem (Q6609717) (← links)