Pages that link to "Item:Q2215200"
From MaRDI portal
The following pages link to Scheduling in data gathering networks with background communications (Q2215200):
Displaying 10 items.
- Communication scheduling in data gathering networks with limited memory (Q272491) (← links)
- Scheduling for data gathering networks with data compression (Q319855) (← links)
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments (Q724122) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- Scheduling for gathering multitype data with local computations (Q2239981) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks (Q5001774) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
- Heuristics for scheduling data requests using collective communications in a distributed communication network (Q5953219) (← links)
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)