Scheduling: Theory and Applications.
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 559, doi. 10.1142/S0129054101000655
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2001 AND VI 12 AND IP 5
Results: 8
1
2
Two Conp-Complete Schedule Analysis Problems.
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 565, doi. 10.1142/S0129054101000667
- By:
- Publication type:
- Article
3
Resource Estimation Algorithm Under Impreciseness Using Inclusion Scheduling.
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 581, doi. 10.1142/S0129054101000679
- By:
- Publication type:
- Article
4
Mapping Arbitrary Heterogeneous Task Graphs Onto Arbitrary Heterogeneous System Graph.
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 599, doi. 10.1142/S0129054101000680
- By:
- Publication type:
- Article
5
Simulation of Hierarchical Resource Management for Meta-Computing Systems.
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 629, doi. 10.1142/S0129054101000692
- By:
- Publication type:
- Article
6
On Dynamic Task Scheduling for FPGA-Based Systems.
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 645, doi. 10.1142/S0129054101000709
- By:
- Publication type:
- Article
7
Solving Rostering Tasks by Generice Methods for Constraint Optimization.
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 671, doi. 10.1142/S0129054101000710
- By:
- Publication type:
- Article
8
Martin-Lof's Type Theory as an Open-Ended Framework: [International Journal of Foundations of Computer Science Vol. 12, No. 1 (2001) 31–37].
- Published in:
- International Journal of Foundations of Computer Science, 2001, v. 12, n. 5, p. 695, doi. 10.1142/S0129054101000722
- By:
- Publication type:
- Article