Works Published in 1993

search works

Displaying works 1 - 20 of 27 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

1993 journal article

ANALYSIS AND OPTIMIZATION OF TRANSMISSION SCHEDULES FOR SINGLE-HOP WDM NETWORKS

Ieee Infocom 93 : the Conference on Computer Communications, Proceedings, Vols 1-3, 1342–1349.

By: G. Rouskas*, M. Ammar* & Ieee

Contributors: M. Ammar*, Ieee & G. Rouskas

TL;DR: The authors define a wide variety of schedules and develop a general framework for analyzing their throughput performance for any number of available wavelengths, any tunability characteristics, and general (potentially nonuniform) traffic patterns. (via Semantic Scholar)
Source: ORCID
Added: June 21, 2023

1993 chapter

Dynamic parallel evaluation of computation DAGs

In J. Reif (Ed.), Synthesis of Parallel Algorithms (pp. 723–758). San Mateo, California: Morgan Kaufmann Publishers.

Ed(s): J. Reif

Source: NC State University Libraries
Added: March 26, 2022

1993 report

Computational differentiation and algebraic complexity theory

In C. H. Bischof, A. Griewank, & P. M. Khademi (Eds.), Workshop Report on First Theory Institute on Computational Differentiation (Technical Report No. ANL/MCS-TM-183; pp. 28–30). Argonne, Illinois: Argonne National Laboratory.

Ed(s): C. Bischof, A. Griewank & P. Khademi

Source: NC State University Libraries
Added: March 26, 2022

1993 journal article

On the system of learning and diagnosis for fostering space concept

Journal of Japan Society for CAI, 10(3), 114–121.

By: N. Matsuda, S. Nagashima, T. Okamoto & S. Takuma

Source: NC State University Libraries
Added: December 26, 2021

1993 journal article

Student modeling for procedural problem solving

IEICE Transactions on Information and Systems, E77-D(1), 49–56.

By: N. Matsuda & T. Okamoto

Source: NC State University Libraries
Added: December 26, 2021

1993 chapter

Computer networking

In T. Okamoto (Ed.), Introduction to Information Education for Teachers: Cases in High-School Education (pp. 180–197). Tokyo: Personal Media.

By: N. Matsuda

Ed(s): T. Okamoto

Source: NC State University Libraries
Added: December 26, 2021

1993 conference paper

Evaluation of a multilanguage videocourse in object-oriented systems

Proceedings of the OOPSLA 1993 Educators’ Symposium. Presented at the OOPSLA 1993 Educators’ Symposium, Washington.

By: E. Gehringer

Event: OOPSLA 1993 Educators’ Symposium at Washington on September 26 - October 1, 1993

Sources: NC State University Libraries, ORCID
Added: October 28, 2021

1993 conference paper

Performance of object caching for object-oriented systems

Proceedings of VLSI ’93. Presented at the VLSI ’93, Very Large Scale Integration, Grenoble, France.

By: J. Chang & E. Gehringer

Event: VLSI ’93, Very Large Scale Integration at Grenoble, France on September 6-8, 1993

Sources: NC State University Libraries, ORCID
Added: October 28, 2021

1993 conference paper

Process scheduling in DSC and the large sparse linear systems challenge

Design and Implementation of Symbolic Computation Systems (DISCO 1993), 66–80.

By: A. Diaz*, M. Hitz*, E. Kaltofen*, A. Lobo* & T. Valente*

Event: Design and Implementation of Symbolic Computation Systems International Symposium, DISCO '93 at Gmunden, Austria on September 15-17, 1993

TL;DR: An algorithm is implemented that can prove a number of more than 1,000 decimal digits prime in about 2 months elapsed time on some 20 computers and a parallel version of a sparse linear system solver is used to compute the solution of sparse linear systems over finite fields. (via Semantic Scholar)
Source: Crossref
Added: June 15, 2021

1993 conference paper

Specifying and Enforcing Intertask Dependencies

In R. Agrawal (Ed.), 19th International Conference on Very Large Data Bases, August 24th-27th 1993, Dublin, Ireland : proceedings (pp. 134–145). Palo Alto: Morgan Kaufmann.

By: P. Attie, M. Singh, A. Sheth & M. Rusinkiewicz

Ed(s): R. Agrawal

Event: 19th International Conference on Very Large Data Bases at Dublin, Ireland on August 24-27, 1993

Source: NC State University Libraries
Added: January 30, 2021

1993 journal article

Workflow Support in Carnot

Bulletin of the Technical Committee on Data Engineering, 16(2), 33–36.

By: C. Tomlinson, P. Attie, P. Cannata, G. Meredith, A. Sheth, M. Singh, D. Woelk

Source: NC State University Libraries
Added: January 30, 2021

1993 conference paper

Integrating enterprise information models in Carnot

Proceedings International Conference on Intelligent and Cooperative Information Systems. Presented at the International Conference on Intelligent and Cooperative Information Systems, Rotterdam, Netherlands.

By: M. Huhns, N. Jacobs, T. Ksiezyk, W. Shen, M. Singh* & P. Cannata

Event: International Conference on Intelligent and Cooperative Information Systems at Rotterdam, Netherlands on May 12-14, 1993

TL;DR: The authors describe a method for integrating separately developed information models that provide a coherent picture of an enterprise and enable its resources to be accessed and modified coherently. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: November 15, 2020

1993 chapter

Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems

In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (pp. 195–212).

TL;DR: It is proved that by use of certain randomizations on the input system the parallel speed up is roughly by the number of vectors in the blocks when using as many processors. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

1993 journal article

Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor

ACM SIGSAM Bulletin, 27(4), 2.

TL;DR: This note presents a direct proof of the following fact: Kalkbrener, Sweedler, and Taylor (1993) present degree bounds on the coefficients needed to express 1 (and other low degree polynomials) asigma. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

1993 journal article

Task Scheduling Using Intertask Dependencies in Carnot

ACM SIGMOD Record, 22(2), 491–494.

By: D. Woelk, P. Attie*, P. Cannata*, G. Meredith*, A. Sheth, M. Singh*, C. Tomlinson*

Contributors: D. Woelk, P. Attie*, P. Cannata*, G. Meredith*, A. Sheth, M. Singh*, C. Tomlinson*

Source: ORCID
Added: December 10, 2019

1993 journal article

A semantics for speech acts

Annals of Mathematics and Artificial Intelligence, 8(1-2), 47–71.

By: M. Singh*

Contributors: M. Singh*

TL;DR: A formal semantics for speech acts is presented here that relates their satisfaction to the intentions, know-how, and actions of the participating agents, which makes it possible to state several potentially useful constraints on communication and provides a basis for checking their consistency. (via Semantic Scholar)
Source: ORCID
Added: December 10, 2019

1993 journal article

Declarative Representations of Multiagent Systems

IEEE Transactions on Knowledge and Data Engineering, 5(5), 721–739.

By: L. Stephens* & M. Singh*

Contributors: L. Stephens* & M. Singh*

author keywords: DECLARATIVE REPRESENTATIONS; DISTRIBUTED ARTIFICIAL INTELLIGENCE; FORMAL SPECIFICATIONS; KNOWLEDGE REPRESENTATION; MULTIAGENT SYSTEMS; PROBLEM-SOLVING SYSTEMS
TL;DR: This paper explores the specification and semantics of multiagent problem-solving systems, focusing on the representations that agents have of each other, and provides a declarative representation for such systems. (via Semantic Scholar)
Source: ORCID
Added: December 10, 2019

1993 journal article

A logic of intentions and beliefs

Journal of Philosophical Logic, 22(5), 513–544.

Contributors: M. Singh* & N. Asher*

TL;DR: A formal theory of intentions and beliefs based on Discourse Representation Theory that captures many of their important logical properties and has an objective semantics, and does not rely on anad hoc labeling of the internal states of agents. (via Semantic Scholar)
Source: ORCID
Added: December 10, 2019

1993 journal article

On the minimum dummy-arc problem

RAIRO-Operations Research, 27, 153–168.

By: D. Michael, J. Kamburowski & M. Stallmann

Source: ORCID
Added: December 6, 2019

1993 conference paper

Fast algorithms for one-dimensionsal compaction with jog insertion

Workshop on Algorithms and Data Structures, 589–600.

By: M. Stallmann & T. Hughes

Event: Springer, Berlin, Heidelberg

Source: ORCID
Added: December 6, 2019

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.