Skip to main content

Research Repository

Advanced Search

Outputs (1517)

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.

Incremental polygonization of deforming NURBS surfaces. (1999)
Journal Article
Li, F., & Lau, R. (1999). Incremental polygonization of deforming NURBS surfaces. Journal of graphics tools (2012), 4(4), 37-50. https://doi.org/10.1080/10867651.1999.10487514

Nonuniform rational B-splines (NURBS) are a powerful tool to model deformable objects. Their shapes can be easily modified by moving the control points. A common method used to render these objects is polygonization. However, the polygonization proce... Read More about Incremental polygonization of deforming NURBS surfaces..

Hierarchies in classes of program schemes (1999)
Journal Article
Arratia-Quesada, A., Chauhan, S., & Stewart, I. (1999). Hierarchies in classes of program schemes. Journal of Logic and Computation, 9(6), 915-957. https://doi.org/10.1093/logcom/9.6.915

We begin by proving that the class of problems accepted by the program schemes of NPS is exactly the class of problems defined by the sentences of transitive closure logic (program schemes of NPS are obtained by generalizing basic non-deterministic w... Read More about Hierarchies in classes of program schemes.

On the power of built-in relations in certain classes of program schemes (1999)
Journal Article
Chauhan, S., & Stewart, I. (1999). On the power of built-in relations in certain classes of program schemes. Information Processing Letters, 69(2), 77-82. https://doi.org/10.1016/s0020-0190%2898%2900196-3

We completely classify the relative expressibilities of the program schemes of NPS augmented with the built-in relations: linear order; addition; multiplication; and BIT. We employ pebble games allied with some number theory.

The Future of Software (1999)
Journal Article
Brereton, P., Budgen, D., Bennett, K., Munro, M., Layzell, P., Macaulay, L., Griffiths, D., & Stannett, C. (1999). The Future of Software. Communications of the ACM, 42(12), 78-84. https://doi.org/10.1145/322796.322813

Companies like British Telecommunications whose business is based on the performance of their software systems, should emphasize accessibility, adaptability, transparency, fail-safe operation, and a human face.