Skip to main content

previous disabled Page of 5
and
  1. No Access

    Chapter and Conference Paper

    Verfahren zur Sicherung und Wiederherstellung von Datenbeständen

    Die zunehmende Komplexität und der enorme Umfang von Datenbeständen, wie sie bei modernen Datensystemen anfallen, werden zukünfig an die Integrität der Daten Anforderungen stellen, die heute noch weitgehend un...

    D. F. Jung in GI. Gesellschaft für Informatik e.V. 2. Jahrestagung (1973)

  2. No Access

    Article

    Time required for reference count management in retention block-structured languages. Part 1

    In this paper, two implementations of generalized block-structured languages are presented and their time requirements compared. One implementation, the lifetime stack model (LSM), implements the deletion stra...

    D. M. Berry, L. M. Chirica, J. B. Johnston in International Journal of Computer & Inform… (1978)

  3. No Access

    Article

    On the time required for reference count management in retention block-structured languages. Part 2

    In this paper, two implementations of generalized block-structured languages are presented and compared for time requirements. One implementation, the Lifetime Stack Model, implements the deletion strategy wit...

    D. M. Berry, L. M. Chirica, J. B. Johnston in International Journal of Computer & Inform… (1978)

  4. No Access

    Chapter

    The Concept of Demodulation in Theorem Proving

    In many fields of mathematics the richness of the underlying axiom set leads to the establishment of a number of very general equalities. For example, it is easy to prove that in groups (x -1)-1= x and that in ri...

    L. T. Wos, G. A. Robinson, D. F. Carson, L. Shalla in Automation of Reasoning (1983)

  5. No Access

    Chapter

    Variation in Inflorescence Structure in Cotoneaster Franchetti

    Cotoneaster franchetti (Rosaceae) is a garden ornamental shrub which in the climate of Christchurch reaches a height of about three metres, with long curving sprays, and bears some leaves right throu...

    D. F. Robinson in The Book of L (1986)

  6. No Access

    Article

    On some union and intersection problems for polygons with fixed orientations

    Objects with fixed orientations play an important role in many application areas, for instance VLSI design. Problems involving only rectilinearly oriented (rectangular) objects, as a simplest case, have been s...

    P. Widmayer, Y. F. Wu, M. D. F. Schlag, C. K. Wong in Computing (1986)

  7. No Access

    Chapter and Conference Paper

    A high resolution parallel Legendre transform algorithm

    The spectral weather forecasting model at ECMWF is a sophisticated parallel program which uses global memory for the large shared data structure which contains the spectral representation of the atmosphere. In...

    D. F. Snelling in Supercomputing (1988)

  8. No Access

    Article

    Floorplan design of VLSI circuits

    In this paper we present two algorithms for the floorplan design problem. The algorithms are quite similar in spirit. They both use Polish expressions to represent floorplans and employ the search method of si...

    D. F. Wong, C. L. Liu in Algorithmica (1989)

  9. No Access

    Chapter

    A High Performance Vector-Parallel Skyline Solver Using Level 3 BLAS

    This paper deals with a parallel solver for matrices stored following the the skyline storage pattern. The algorithm performs the Gaussian elimination by using the Level 3 BLAS blocked approach. Large grain pa...

    D. F. Lozupone in Applications of Supercomputers in Engineering II (1991)

  10. No Access

    Article

    Probabilistic analysis of a grou** algorithm

    We study thegrou** by swap** problem, which occurs in memory compaction and in computing the exponential of a matrix. In this problem we are given a sequence ofn numbers drawn from {0,1, 2,...,m−1} with repet...

    D. F. Wong, Edward M. Reingold in Algorithmica (1991)

  11. No Access

    Chapter and Conference Paper

    Improving Simple Classifier Systems to alleviate the problems of Duplication, Subsumption and Equivalence of Rules

    For new, potentially improved rules that is, the search performed by a classifier system’s genetic algorithm is guided by the relative strength of the rules in the extant rule base. This paper identifies three...

    A. Fairley, D. F. Yates in Artificial Neural Nets and Genetic Algorithms (1993)

  12. No Access

    Chapter

    The Impact of New Architectures on the Ubiquitous Operational Amplifier

    The operational amplifier has steadily evolved since its inception almost fifty years ago. Sometimes though, radically new architectures appear to fill market requirements. Also, the availability of new I.C. p...

    D. F. Bowers in Analog Circuit Design (1993)

  13. No Access

    Chapter and Conference Paper

    Evolutionary stability in simple classifier systems

    In this paper, the relatively new branch of mathematics known as Evolutionary Game Theory is proposed as a potentially useful tool when seeking to resolve certain of the more global, unanswered questions relat...

    D. F. Yates, A. Fairley in Evolutionary Computing (1994)

  14. No Access

    Chapter and Conference Paper

    Inductive operators and rule repair in a hybrid genetic learning system: Some initial results

    Symbolic knowledge representation schemes have been suggested as one way to improve the performance of classifier systems in the context of complex, real-world problems. The main reason for this is that unlike...

    A. Fairley, D. F. Yates in Evolutionary Computing (1994)

  15. No Access

    Article

    The effort required by LCSAJ testing: an assessment via a new path generation strategy

    In general, LCSAJ testing more thoroughly exercises the control structure of a piece of software than does either statement or branch testing. Despite this, the exceptionally small number of papers which detai...

    D. F. Yates, N. Malevris in Software Quality Journal (1995)

  16. Chapter

    A Teamwork Approach to Decision Support System Development for Watershed Management Problems

    Decision-support systems (DSS) for solving complex environmental problems are not merely computer software systems. A working system requires data and knowledge inputs from domain scientists and the results ne...

    D. C. L. Lam, D. A. Swayne, G. S. Bowen, D. F. Kay in Environmental Software Systems (1996)

  17. No Access

    Chapter and Conference Paper

    Detecting Small Features in SAR Images by an ANN

    Synthetic aperture radar (SAR) images are intrinsically noisy, and processing them attracts a high computational overhead. This paper relates to developments, involving the use of an ANN to reduce the overhead...

    I. Finch, D. F. Yates, L. M. Delves in Artificial Neural Nets and Genetic Algorithms (1998)

  18. No Access

    Article

    Digital boundary tracking

    In many three-dimensional imaging applications, the three-dimensional space is represented by an array of cubical volume elements (voxels) and a subset of the voxels is specified by some property. Objects in t...

    G. T. Herman, D. F. Robinson in Pattern Analysis and Applications (1998)

  19. No Access

    Chapter and Conference Paper

    Trapped Ion Quantum Computer Research at Los Alamos

    We briefly review the development and theory of an experiment to investigate quantum computation with trapped calcium ions. The ion trap, laser and ion requirements are determined, and the parameters required ...

    D. F. V. James, M. S. Gulley in Quantum Computing and Quantum Communicatio… (1999)

  20. No Access

    Chapter

    Algorithms for Restoration Planning in a Telecommunications Network

    One of the major tasks of telecommunications network planners is deciding where and how much spare capacity to build so that disrupted traffic may be rerouted in the event of a network failure.

    S. Cwilich, M. Deng, D. F. Lynch in Algorithm Engineering and Experimentation (1999)

previous disabled Page of 5