Institutional Repository

Browsing SAICSIT Digital Archive by Title

Browsing SAICSIT Digital Archive by Title

Sort by: Order: Results:

  • The P-NP Question and Recent Independence Results 
    Philips, N.C.K. (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    Despite intensive research the P = NP question is unresolved and the research suggests thatitis hard to answer. The corresponding question for query machines with recursive oracles is undecidable in set theory. Simply ...
  • 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.
  • Parallel distributed objects' structure and their synchronization in an APPC environment 
    Kisimov, V; Da Silva, I (South African Computer Society (SAICSIT), 1995)
    Over a period of a few hours, every computer participating in a distributed system has many unused resources. If these resources can be combined, a large amount of computational power can be generated. This paper offers ...
  • Parallel execution strategies for conventional logic problems: A review 
    Lutu, PEN (South African Computer Society (SAICSIT), 1994)
    Parallel execution strategies/or Prolog programs are reviewed. Three models, AOPM, APPNet and RAP are discussed in some detail. The AOPM and the APPNet are AND-OR parallel execution models and represent the two ends of the ...
  • Parallel hierarchical algorithm for identification of large-scale industrial systems 
    Jankovic, B; Bajic, VB (1996)
    Parallel execution is the most powerful method of speeding up numerical analysis. However, numerical complexity increases much faster than the problem size. For this reason the computational effort required for the analysis ...
  • Parallelism: an effective genetic programming implementation on low-powered mathematica workstations 
    Suleman, H; Hajek, M (1996)
    Mathematica has proven itself to be a suitable platform on which to develop prototype Genetic Programming applications. However, due to the sheer complexity of genetic programming calculations, non-trivial problems cannot ...
  • Partial edge visibility in linear time 
    Bilbrough, J; Sanders, I (1998)
    This research addresses the problem of partial edge visibility. This problem stems from work done in the ray guarding of configurations of adjacent rectangles [7]. In ray guarding these configurations it is necessary to ...
  • A partial RJE pad specification to illustrate LOTOS 
    Kourie, D.G. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    LOTOS (Language Of Temporal Ordering Specification) is employed to give a partial specification of a system to connect RJE devices across an X.25 network. The system's implementation has been described fully elsewhere ...
  • A partitioning scheme for solving the exact K-item 0-1 knapsack problem 
    Kruger, MF; Hattingh, JM (1998)
    Our investigation on the impact of partitioning the search space of the classical 0- 1 Knapsack Problem through the inclusion of equality constraints on the knapsack's cardinality, has given rise to the study we undertook ...
  • A pattern architecture: using patterns to define an overall systems architecture 
    Van Zyl, J; Walker, AJ (2001)
    The notion of patterns has been used in many different disciplines, and the software industry is no exception. There are many books written, academic research done and practical examples available of where patterns have ...
  • Paying for high speed network services 
    Smuts, WB (1995)
    The real-time services offered by modern high speed networks are complex enough to prompt a new look at how these services should be paid for. In this article, it is motivated that paying for the use of guaranteed services ...
  • The pearl algorithm as a method to extract information out of a database 
    Kruger, JW (1996)
    Big databases have been built up over time. The information in these databases can be converted by the Pearl algorithm [ Pearl 1988 ] from data to information. When a promotional drive is initiated, do we know who the ...
  • A performance analyser for the numerical solution of general Markov chains 
    Knottenbelt, W; Kritzinger, P (South African Computer Society (SAICSIT), 1998)
    Despite many advances in queueing theory and other modelling paradigms, one persistenty discovers real life stochastic systems which do not yield neatly to existing methods for their performance analysis. In most such ...
  • A persistent programming language: preliminary Report 
    Berman, Sonia (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    A persistent programming language PPL is currently being designed at the University of Cape Town. The language treats persistence (permanent storage) as an orthogonal property of data and is consistent in its treatment of ...
  • PEST - A microcomputer Pascal base expert system shell 
    Sartori-Angus, AG; Neville, R (South African Institute of Computer Scientists and Information Technologists, 1991)
    The PEST System is a totally interactive, forward chaining, rule-based expert system shell. It was primarily, though not exclusively, designed for the development of scientifically related expert systems in Pascal, involving ...
  • Petri net topologies for a specification language 
    Watson, AG (1987)
    This paper presents a formal technique for enforcing deterministic exec­ution in Petri nets, and proceeds to demonstrate how the resultant topology may be used to enforce partial sequencing so that various ...
  • PEW: A tool for the automated performance analysis of protocols 
    Wheeler, G; Kritzinger, Pieter S. (South African Computer Society (SAICSIT), 1992)
    The Protocol Engineering Workbench (PEW) is an integrated software system or tool for the analysis of communication protocols specified using the Estelle Formal Description Technique or FDT. The execution of systems specified ...
  • pGCL: formal reasoning for random algorithms 
    Morgan, C; McI, A (South African Computer Society (SAICSIT), 1998)
    Dijkstra's guarded-command language GCL contains explicit 'demonic' nondeterminism, representing abstraction from (or ignorance of ) which of two program fragments will be executed. We introduce probabilistic nondeterminism ...
  • The physical correlates of local minima 
    Wessels, LFA; Barnard, E; Van Rooyen, E (South African Institute of Computer Scientists and Information Technologists, 1991)
    The training of neural-net classifiers is often hampered by the occurrence of local minima, which results in the attainment of inferior classification performance. We study the problem of local minima in order to devise ...
  • The placement of subprograms by an automatic programming system 
    Du Plessis, JP; Messerschmidt, HJ (South African Institute of Computer Scientists and Information Technologists, 1991)
    Programming in a procedural language such as Pascal usually involves the development of subprograms. An auto­matic programming system needs a systematic method to determine the placement (position) of a subprogram in a ...

Search UnisaIR


Browse

My Account