Institutional Repository

Browsing Quaestiones Informaticae Vol 6 No 3 by Issue Date

Browsing Quaestiones Informaticae Vol 6 No 3 by Issue Date

Sort by: Order: Results:

  • Learning the first step in requirements specification 
    Short, R.M.C. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Learning about the domain into which an information system will fit is an essential part of the system development process. In this paper it is argued that the first stage of the development process should be learning ...
  • Experiences in CSP trace generation 
    Kourie, D.G.; Van den Heever, R.J. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Experiences and insights gained from implementing and using a Prolog trace generator for CSP specifications are discussed. The use of Prolog as an implementation language is evaluated. The value of trace generation as ...
  • Die meting van sukses van naampassingsalgoritmes in 'n genealogiese databasis 
    De Kock, G de V (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Norms to measure the success of surname matching algorithms for use in a South African Genealogical Database are proposed. Surnames in the database can be grouped in equivalence classes. These algorithms are taken from ...
  • A proposed computer network for researchers 
    McDonald, T (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In contrast to other countries, South Africa has sadly lacked a computer network for researchers. This paper starts with previous efforts to establish a national network for researchers and gives possible reasons for ...
  • The parallel conditional 
    Postma, Stef W.; Philips, N.C.K. (S W Postma and N C K Phillips (1988) The parallel conditional. Computer Society of South Africa (on behalf of SAICSIT), 1988)
    The parallel conditional is a new but natural programming language construct. It is particularly suited to evaluation on parallel maclunes and generalizes other well known conditionals.
  • Frame clipping of polygons 
    Anderssen, E.C.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    A polygon clipping algorithm is presented for the clipping of closed geographical areas such as dams or forests, against a surrounding rectangular windowframe. The algorithm employs a line clipping procedure which divides ...
  • Finding a cheap matching 
    Smith, T.H.C. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    We propose an edge exchange algorithm/or finding a cheaper 1-matchingfrom a given ]-matching as well as a heuristic algorithm/or constructing a relatively cheap ]-matching from the optimal solution of a relaxation of the ...
  • Ranking information system problems in a user environment 
    Bruwer, P.J.S. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In a previous research project (Bruwer [ 1 J) a methodology to identify information system problems from a user point of view, was presented. This methodology was also illustrated by means of empirical data collected ...

Search UnisaIR


Browse

My Account