Outputs (6)

Infinite parallel job allocation (extended abstract) (2000)
Presentation / Conference Contribution
Berenbrink, P., Czumaj, A., Friedetzky, T., & Vvedenskaya, N. D. (2000, December). Infinite parallel job allocation (extended abstract). Presented at Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures - SPAA '00

Dual-conjugate wavefront generation for adaptive optics (2000)
Journal Article
Kelly, T., Buscher, D., Clark, P., Dunlop, C., Love, G., Myers, R., …Zadrozny, A. (2000). Dual-conjugate wavefront generation for adaptive optics. Optics Express, 7(11), 368-374. https://doi.org/10.1364/oe.7.000368

We present results of the isoplanatic performance of an astronomical adaptive optics system in the laboratory, by using a dual layer turbulence simulator. We describe how the performance of adaptive correction degrades with off-axis angle. These expe... Read More about Dual-conjugate wavefront generation for adaptive optics.

Component-based systems: A classification of issues (2000)
Journal Article
Brereton, P., & Budgen, D. (2000). Component-based systems: A classification of issues. Computer, 33(11), 54-62. https://doi.org/10.1109/2.881695

Although component-based development offers many potential benefits, such as greater reuse and a commodity-oriented perspective of software, it also raises several issues that developers need to consider. A set of issues organized within an overall f... Read More about Component-based systems: A classification of issues.

Note on the computational complexity of least core concepts for min-cost spanning tree games (2000)
Journal Article
Faigle, U., Kern, W., & Paulusma, D. (2000). Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical Methods of Operations Research, 52(1), 23-38. https://doi.org/10.1007/s001860000059

Various least core concepts including the classical least core of cooperative games are discussed. By a reduction from minimum cover problems, we prove that computing an element in these least cores is in general NP-hard for minimum cost spanning tre... Read More about Note on the computational complexity of least core concepts for min-cost spanning tree games.

Supporting program comprehension using dominance trees (2000)
Journal Article
Burd, E., & Munro, M. (2000). Supporting program comprehension using dominance trees. Annals of Software Engineering, 9(1-2), 193-213. https://doi.org/10.1023/a%3A1018928825530

This paper will address how program comprehension can be aided within software maintenance through the use of high level representations of code, specifically the use of dominance trees. The paper proposes that dominance trees should be used as a sta... Read More about Supporting program comprehension using dominance trees.

Service-based software: The future for flexible software (2000)
Presentation / Conference Contribution
Bennett, K., Layzell, P., Budgen, D., Brereton, P., Macaulay, L., & Munro, M. (1999, December). Service-based software: The future for flexible software. Presented at Proceedings - Asia-Pacific Software Engineering Conference, APSEC, Singapore

For the past 40 years, the techniques, processes and methods of software development have been dominated by supply-side issues, giving rise to a software industry oriented towards developers rather than users. To achieve the levels of functionality,... Read More about Service-based software: The future for flexible software.