Search
Skip to Search Results- 414Computing Science, Department of
- 315Computing Science, Department of/Technical Reports (Computing Science)
- 71Computing Science, Department of/Conference Papers (Computing Science)
- 23Computing Science, Department of/Journal Articles (Computing Science)
- 4Computing Science, Department of/Research Data and Materials (Computing Science)
- 1Computing Science, Department of/Presentations (Computing Science)
- 95Hindle, Abram
- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 9Databases
- 9Software Engineering
-
1988
Culberson, Joseph, Rawlins, Gregory
Technical report TR88-01. A great deal of effort has been directed towards determining the minimum number of binary comparisons sufficient to produce various partial orders given some partial order. For example, the sorting problem considers the minimum number of comparisons sufficient to...
-
1988
Marsland, Tony, Sutphen, Steven, Breitkreutz, T.
Technical report TR88-22. The report describes an environment for performing experiments in distributed processing. It replaces an earlier (1985) report, reflecting changes in the system and terminology. Our system offers researchers an easy way to design, implement, and test parallel...
-
1989
Marsland, Tony, Breitkreutz, T., Sutphen, Steven
Technical report TR89-11. This paper explains how to write Network Multiprocessor Package (NMP) applications. The technical report NMP--A Network Multi-processor [TR88-22] contains an overview of NMP, implementation details, more advanced usage information, and instructions for installing the...
-
1990
Technical report TR90-33. Object-oriented database systems have been proposed as an effective solution for providing the data management facilities of complex applications. Proving the veracity of this claim and the investigation of related issues such as query processing have been hampered by...
-
1991
Greenlaw, Raymond, Ruzzo, Walter L., Hoover, James
Technical report TR91-11. This paper serves two purposes. Firstly, it is an elementary introduction to the theory of P-completeness - the branch of complexity theory that focuses on identifying the problems in the class P that are \"hardest\" in the sense that they appear to lack highly parallel...
-
Enterprise: An Interactive Graphical Programming Environment For Distributed Software Development
Download1991
Mohsin, Jimmy, Schaeffer, Jonathan, Lu, Paul, Chan, Enoch, Szafron, Duane, Smith, Carol, Wong, Pok Sze
Technical report TR91-17. Workstation environments have been in use for more than a decade now. Although a network of workstations together represents a large amount of aggregate computing power, single users often cannot utilize these resources for their applications. Enterprise is a...
-
1991
Rudnicki, Piotr, Hoover, James
Technical report TR91-02. We present a very simple protocol for the self-stabilizing orientation of a unicyclic network of uniform processors. It has the same O(n2) performance as the Israeli and Jalfon protocol for rings but is much simpler to state and furthermore operates under the weaker...
-
1992
Peters, Randal J., Szafron, Duane, Ozsu, M. Tamer
Technical report TR92-14. Object-oriented computing is influencing many areas of computer science including software engineering, user interfaces, operating systems, programming languages and database systems. The appeal of object-orientation is attributed to its higher levels of abstraction for...
-
1992
Technical report TR92-17. The AGM postulates for knowledge base revision are a set of rationality postulates that revision operations on knowledge systems should satisfy. Defining an appropriate semantics for belief revision that satisfies all of the postulates has been considered a challenging...
-
Autoepistemic Circumscription and Logic Programming
1992
Technical report TR92-18. We propose a framework of autoepistemic reasoning in which the underlying semantics is determined by the choice of a nonmonotonic inference mechanism and by specifying a belief constraint. While the latter makes the approach flexible in meeting possibly different...