Pages that link to "Item:Q319855"
From MaRDI portal
The following pages link to Scheduling for data gathering networks with data compression (Q319855):
Displaying 7 items.
- 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)
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- Scheduling in data gathering networks with background communications (Q2215200) (← links)
- Scheduling for gathering multitype data with local computations (Q2239981) (← links)
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)
- An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements (Q6497031) (← links)
