Search

1992

Yuan, Li-Yan

Technical report TR92-15. In this paper we propose the minimal well-founded semantics for logic programs with negation based on the fixpoint of the double Gelfond-Lifschitz transformation which overcomes the existing problems associated with the stable, the well-founded, and the stable class...

1992

Culberson, Joseph

Technical report TR92-06. This document describes the gene invariant genetic algorithm (GIGA) program. This program represents a unique approach to designing GAs with many interesting results. The primary distinguishing feature is that when a pair of offspring are created and chosen as worthy...

1992

Wong, Pok Sze

Technical report TR92-13. Enterprise is a graphical programming environment for designing, coding, debugging, testing, monitoring, profiling and executing programs in a distributed hardware environment. Enterprise code looks like familiar sequential code. The user attaches icons, called assets,...

1992

Schaeffer, Jonathan

Technical report TR92-19. In August 1992, the first man versus machine world championship took place. The champion, Dr. Marion Tinsley, is arguably the greatest checkers player that ever lived. The challenger was the computer checkers program Chinook, a 3 year team effort from the University of...

1992

Yuan, Li-Yan, You, Jia-Huai

Technical report TR92-16. Recent proposals for semantics of default theories are all based on some types of weaker notion of extensions. This is typified in the well-founded semantics and the extension class semantics for default theories. Although these semantics solve the no-extension problem...

1992

Culberson, Joseph

Technical report TR92-02. This paper presents some experimental results and analyses of the gene invariant genetic algorithm(GIGA). Although a subclass of the class of genetic algorithms, this algorithm and its variations represent a unique approach with many interesting results. The primary...

1992

Culberson, Joseph

Technical report TR92-07. Many heuristic algorithms have been proposed for graph coloring. The simplest is perhaps the greedy algorithm. Many variations have been proposed for this algorithm at various levels of sophistication, but it is generally assumed that the coloring will occur in a...

1992

Yang, Zhonghua, Marsland, Tony

Technical report TR92-03. The widespread adoption of distributed computing has accentuated the need for an effective set of support tools to facilitate debugging and monitoring. In providing such support, one fundamental problem is that of constructing a global snapshot or global state of a...

1992

Ghose, Aditya, Geobel, Randy, Yuan, Li-Yan

Technical report TR92-09. In many database applications, designers can easily provide at least some information about the relative importance of the information to be stored and manipulated. While of potentially high value, the ordering information is typically only partial. Here we address the...

1992

Schaeffer, Jonathan, Lobe, Greg, Parsons, Ian, Szafron, Duane, Melax, Stan, Smith, Carol, Lu, Paul

Technical report TR92-20. Workstations have been in use for more than a decade now. Although a network of workstations represents a large amount of aggregate computing power, there is a need for software that can harness this power for single, distributed applications. Enterprise is an...