Found 4078 results
Author Title Type [ Year(Asc)]
Herrtwich, R. Guido, & Brandenburg U. Wolfgang (1989).  Accessing and Customizing Services in Distributed Systems.
Moody, J., Shapere A. D., & Wilczek F. (1989).  Adiabatic Effective Lagrangian.
Demers, A. J., Keshav S., & Shenker S. (1989).  Analysis and Simulation of a Fair Queuing Algorithm. Proceedings of the 1989 SIGCOMM Symposium on Communications Architectures & Protocols. 1-12.
Haban, D., & Shin K. G. (1989).  Application of Real-Time Monitoring to Scheduling Tasks with Random.
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Gibbons, P. B. (1989).  The Asynchronous PRAM: A Semi-Synchronous Model for Shared Memory MIMD Machines (Thesis).
Haban, D., & Wybranietz D. (1989).  Behavior and Performance Analysis of Distributed Systems Using a Hybrid.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Kobsa, A. (1989).  Conceptual Hierarchies in Classical and Connectionist Architecture.
Munro, P. W. (1989).  Conjectures on Representations in Backpropagation Networks.
Stolcke, A. (1989).  A Connectionist Model of Unification.
Feldman, J. (1989).  Connectionist Representation of Concepts. 25-45.
Cleve, R., & Dagum P. (1989).  A Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t).
Cleve, R. (1989).  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the 3MIS Problem.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO).
Kay, R. (1989).  The Establishment of the International Computer Science Institute in Berkeley, California: Venturing with Norbert.
Diederich, J. (1989).  Explanation and Connectionist Systems.