The following pages link to Joanna Berlińska (Q272490):
Displaying 10 items.
- Communication scheduling in data gathering networks with limited memory (Q272491) (← links)
- Scheduling for data gathering networks with data compression (Q319855) (← links)
- (Q843174) (redirect page) (← links)
- Experimental study of scheduling with memory constraints using hybrid methods (Q843175) (← links)
- Heuristics for multi-round divisible loads scheduling with limited memory (Q991099) (← links)
- Scheduling in data gathering networks with background communications (Q2215200) (← links)
- Scheduling for gathering multitype data with local computations (Q2239981) (← links)
- Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads (Q3583567) (← links)
- Scheduling Multilayer Divisible Computations (Q5247698) (← links)
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)
