Browsing Research Articles (Computer Science) by Issue Date

Browsing Research Articles (Computer Science) by Issue Date

Sort by: Order: Results:

  • Sensitivity analysis of voronoi-based sensor deployment and reconfiguration algorithms 
    Nicholls, Gareth; Kourie, Derrick G.; Strauss, Tinus (Computer Society of South Africa, 2009-07)
    This study examines the effects of location inaccuracies on two movement-assisted Voronoi-based sensor deployment and reconfiguration algorithms, VEC and VOR, due to Wang et al. For the purposes of examining the extent ...
  • Address databases for national SDI : comparing the novel data grid approach to data harvesting and federated databases 
    Coetzee, Serena Martha; Bishop, Judith (International Journal of Geographical Information Science, 2009-09-07)
    The original purpose of addresses was to enable the correct and unambiguous delivery of postal mail. The advent of computers and more specifically geographic information systems (GIS) opened up a whole new range of ...
  • Collective neuro-evolution for evolving specialized sensor resolutions in a multi-rover task 
    Nitschke, G.S.; Schut, M.C.; Eiben, A.E. (Springer, 2009-12)
    This article presents results from an evaluation of the collective neuro-evolution (CONE)controller design method. CONE solves collective behavior tasks, and increases task performance via facilitating emergent behavioral ...
  • Perceptions of virtual globes, volunteered geographical information and spatial data infrastructures 
    Cooper, Antony Kyle; Coetzee, Serena Martha; Kourie, Derrick G. (Canadian Institute of Geomatics, 2010)
    The Internet has spawned the development of virtual communities or virtual social networks which generate and share information with one another, and with the public at large. Volunteered geographical information (VGI) ...
  • A convergence proof for the particle swarm optimiser 
    Van den Bergh, Frans; Engelbrecht, Andries P. (IOS Pres, 2010)
    The Particle Swarm Optimiser (PSO) is a population based stochastic optimisation algorithm, empirically shown to be efficient and robust. This paper provides a proof to show that the original PSO does not have guaranteed ...
  • Robotic architectures 
    Mtshali, Mbali; Engelbrecht, Andries P. (Defence Scientific Information and Documentation, 2010-01)
    In the development of mobile robotic systems, a robotic architecture plays a crucial role in interconnecting all the sub-systems and controlling the system. The design of robotic architectures for mobile autonomous robots ...
  • URDAD as a semi-formal approach to analysis and design 
    Solms, Fritz; Loubser, Dawid (Springer, 2010-01)
    The Use Case, Responsibility Driven Analysis and Design (URDAD) methodology is a methodology for technology neutral design generating the Platform Independent Model of the Object Management Group’s Model Driven Architecture. ...
  • The South African Computer Journal : 1989 to 2010 
    Kourie, Derrick G. (Royal Society of South Africa, 2010-06)
    The South African Computer Journal (SACJ), as the successor of the Quæstiones Informaticæ journal founded by Derek Henderson, is part of his heritage to South Africa. This brief historical sketch of SACJ outlines the ...
  • Deadlock-freeness of hexagonal systolic arrays 
    Gruner, Stefan; Steyn, T.J. (Elsevier, 2010-07)
    With the re-emergence of parallel computation for technical applications in these days also the classical concept of systolic arrays is becoming important again. However, for the sake of their operational safety, the ...
  • Academic alignment to reduce the presence of 'social loafers' and 'diligent isolates' in student teams 
    Pieterse, Vreda; Thompson, J.E. (Lisa) (Routledge, 2010-08)
    The acquisition of effective teamwork skills is crucial in all disciplines. Using an interpretive approach, this study investigates collaboration and co-operation in teams of software engineering students. Teams whose ...
  • A novel particle swarm niching technique based on extensive vector operations 
    Schoeman, I.L.; Engelbrecht, Andries P. (Springer, 2010-09)
    Several techniques have been proposed to extend the particle swarm optimization (PSO) paradigm so that multiple optima can be located and maintained within a convoluted search space. A significant number of these impl ...
  • FM+AM’09 : workshop on formal methods and agile methods 
    Gruner, Stefan (Springer, 2010-12)
    This workshop aimed at bringing two orthogonal viewpoints about development methods in software engineering together.We were seeking new contributions towards making formal software development faster, and rapid software ...
  • Extending backward polygon beam tracing of glossy scattering surfaces 
    Duvenhage, B.; Bouatouch, K.; Kourie, Derrick G. (Wiley-Blackwell, 2011)
    Backward polygon beam tracing methods, that is beam tracing from the light source (L), are well suited to gather path coherency from specular (S) scattering surfaces. These methods are useful for modelling and efficiently ...
  • A fuzzy particle swarm optimization algorithm for computer communication network topology design 
    Khan, Salman Ahmad; Engelbrecht, Andries P. (Springer, 2011)
    Particle swarm optimization (PSO) is a powerful optimization technique that has been applied to solve a number of complex optimization problems. One such optimization problem is topology design of distributed local area ...
  • A polar coordinate particle swarm optimiser 
    Matthysen, Wiehann; Engelbrecht, Andries P. (Elsevier, 2011-01)
    The Particle Swarm Optimisation (PSO) algorithm consists of a population (or swarm) of particles that are “flown” through an n-dimensional space in search of a global best solution to an optimisation problem. PSO operates ...
  • On compound purposes and compound reasons for enabling privacy 
    Van Staden, W.J.S. (Wynand Johannes Christiaan); Olivier, Martin S. (Graz University of Technology, 2011-02-01)
    This paper puts forward a verification method for compound purposes and compound reasons to be used during purpose limitation. When it is absolutely necessary to collect privacy related information, it is essential ...
  • Using sequential deviation to dynamically determine the number of clusters found by a local network neighbourhood artificial immune system 
    Graaff, A.J. (Alexander Jakobus); Engelbrecht, Andries P. (Elsevier, 2011-03)
    Many of the existing network theory based artificial immune systems have been applied to data clustering. The formation of artificial lymphocyte (ALC) networks represents potential clusters in the data. Although these ...
  • Cross-impact analysis experimentation using two techniques to revise marginal probabilities of interdependent events 
    Mphahlele, M.I.; Olugbara, O.O.; Ojo, S.O.; Kourie, Derrick G. (Operations Research Society of SA, 2011-03)
    Cross-impact analysis relies on decision makers to provide marginal probability estimates of interdependent events. Generally, these have to be revised in order to ensure overall system coherency. This paper describes ...
  • Unsupervised discovery of relations for analysis of textual data 
    Louis, A.L.; Engelbrecht, Andries P. (Elsevier, 2011-04)
    This paper addresses the problem of analysing textual data for evidence discovery.A novel framework in which to perform evidence discovery is proposed in order to reduce the quantity of data to be analysed, aid the analysts’ ...
  • Problems for a philosophy of software engineering 
    Gruner, Stefan (Springer, 2011-05)
    On the basis of an earlier contribution to the philosophy of computer science [Ede2007] this essay discusses to what extent the ‘paradigms’ of computer science from [Ede2007] are also applicable to software engineering, ...