ICCI C

75 papers

YearTitle / Authors
1991A Backend Text Retrieval Machine for Signature-Based Document Ranking.
Budi Yuwono, Dik Lun Lee
1991A Chemical Reactor Selection Expert System Created by Training an Artificial Neural Network.
Abhay B. Bulsari, Björn Saxén, Henrik Saxén
1991A Design and Modeling Environment to Develop Real-Time, Distributed Software Systems.
Reda A. Ammar, Ping Zhang
1991A Distributed Scheduling Algorithm for Heterogeneous Real-Time Systems.
Osman ZeinElDine, Mohamed Eltoweissy, Ravi Mukkamala
1991A Distributed Solution to the k-out of-M Resources Allocation Problem.
Michel Raynal
1991A Fault-Tolerant Binary Tree Architecture.
Siu-Cheung Chau, Arthur L. Liestman
1991A Formal Description of the IC
B. Gopinath, Ambuj K. Singh, Prem Uppaluru
1991A Framework for Variable -Resolution Vision.
Anup Basu, Xiaobo Li
1991A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems.
Jean Frédéric Myoupo
1991A Modeling Technique for Generating Causal Explanations of Physical Systems.
Rattikorn Hewett
1991A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array.
Danny Krizanc
1991A Proof-Theoretic Framework for Nonmonotonic Reasoning and Logic Programming.
Li-Yan Yuan, Jia-Huai You, Cheng Hui Wang
1991A Relationship Between Self-Organizing Lists and Binary Search Trees.
Tony W. Lai, Derick Wood
1991A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem.
Rong Lin, Stephan Olariu
1991A Tight Lower Bound for Selection in Sorted X+Y.
Michel Cosnard, Afonso Ferreira
1991Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings
Frank K. H. A. Dehne, Frantisek Fiala, Waldemar W. Koczkodaj
1991An Efficient Algorithm for Quiescence Detection in a Distributed System.
Satyendra P. Rana
1991An Efficient Approximation Algorithm for Hypercube Scheduling.
Alfred J. Boals, Ajay Gupta, Jahangir A. Hashmi, Naveed A. Sherwani
1991An Efficient Multiprocessor Architecture for Image Processing in VLSI.
Hee Yong Youn
1991An Improved Join Dependency for Efficient Constraint Checking.
Kok-Phuang Tan, T. C. Tan
1991An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem.
Ip-Wang Chan, Donald K. Friesen
1991An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals.
Stephan Olariu, C. Michael Overstreet, Zhaofang Wen
1991An RMS for Temporal Reasoning with Abstraction.
V. Sundararajan, Hitesh N. Dholakia, N. Parameswaran
1991Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees.
James Haralambides, Fillia Makedon
1991Artificial Neural Networks for Predicting Silicon Content in Raw Iron From Blast Furnaces.
Abhay B. Bulsari, Henrik Saxén
1991Balance in AVL Trees.
Helen Cameron, Derick Wood
1991Compact Hypercubes: Properties and Recognition.
Alfred J. Boals, Ajay K. Gupta, Jahangir A. Hashmi, Naveed A. Sherwani
1991Computer Science and Communications Protocols: Research Relationships.
Robert L. Probert
1991Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models.
Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen
1991Context Inheritance and Content Inheritance in an Object-Oriented Data Model.
Li Yu, Sylvia L. Osborn
1991Efficient Distributed Resource Scheduling for Adaptive Real-Time Operation Support.
Horst F. Wedde, Douglas C. Daniels, Dorota M. Huizinga
1991Empirical Study of the Meaning of the Hedge "VERY".
Patricia Cerrito, Waldemar Karwowski, Krzysztof Ostaszewski
1991Enhanced Reliability in Scheduling Critical Tasks for Hard Real-Time Distributed Systems.
Ghasem S. Alijani, Horst F. Wedde
1991Extended Cycle Shrinking: A Restructuring Method for Parallel Compilation.
Supratim Biswas, Amitabha Sanyal, L. M. Tewari
1991Folding a Triangulated Simple Polygon: Structural and Algorithmic Results.
Ali A. Kooshesh, Bernard M. E. Moret
1991Generalized Fault Tolerance Properties of Star Graphs.
Pradip K. Srimani
1991Generating Random Graphs Efficiently.
Rajeev Raman
1991Graphical Specification of Recursive Queries.
Bogdan D. Czejdo, Ralph P. Tucci, David W. Embley
1991Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case.
Christos Levcopoulos, Andrzej Lingas
1991How Costly Can Red-Black Trees Be?
Helen Cameron, Derick Wood
1991Increasing Communication Bandwidth on Hypercube.
Zhiyong Liu, Jia-Huai You
1991Incremental Database Design Revisited.
Ke Wang, Li-Yan Yuan
1991Interval Arithmetic for Computing Performance Guarantees in Client-Server Software.
C. Murray Woodside, Shikharesh Majumdar, John E. Neilson
1991Kernel Knowledge Versus Belt Knowledge in Default Reasoning: a Logical Approach.
M. A. Nait Abdallah
1991Linear Extensions with Backtracking.
Ivan Rival, Siming Zhan
1991Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs.
Lin Chen
1991Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains.
Nader H. Bshouty
1991Mapping of Fault-Tolerant Permutations in Omega.
Uma Bhattacharya, Swapan Bhattacharya
1991Methods and Tools for Integrating Database Systems and Object-Oriented Programming Systems.
Bogdan D. Czejdo, Malcolm C. Taylor
1991Neural Network Processing Elements as a New Generation of "Flip-Flops".
Eugeniusz Eberbach
1991On Designing Relational Database Schemes for Efficient Query Processing.
Michio Nakanishi, Yoshiki Katsuyama, Minoru Ito, Akihiro Hashimoto
1991On Semantics, Syntactics and Fixpoints of General Programs.
Li-Yan Yuan
1991On the Fault-Tolerance of Quasi-Minimal Cayley Networks.
Marc Baumslag
1991On the Management of Remote Procedure Call Transactions.
Wanlei Zhou, Brian Molinari
1991On the Power of Query-Independent Compilation.
Jiawei Han
1991On the Quickest Path Problem.
Yung-Chen Hung, Gen-Huey Chen
1991On the k-Coloring of Intervals.
Martin C. Carlisle, Errol L. Lloyd
1991Parallel Routing and Sorting of the Pancake Network.
Ke Qiu, Henk Meijer, Selim G. Akl
1991Parallel Transitive Closure Computation in Highly Scalable Multiprocessors.
Anestis A. Toptsis
1991Partial Document Ranking by Heuristic Methods.
Dik Lun Lee, Wai Yee Peter Wong
1991Partitioning and Scheduling of Parallel Functional Programs Using Complexity Information.
Piyush Maheshwari
1991Planning in Conceptual Networks.
Leixuan Yang, Stan Szpakowicz
1991Practical Adaptive Sorting.
Vladimir Estivill-Castro, Derick Wood
1991Practical Parallel Algorithms for Chordal Graphs.
Eric S. Kirsch, Jean R. S. Blair
1991Programming a Parallel Sort Using Distributed Procedure Calls.
Daniel Herman, Laurent Trilling
1991Reaping the Benefits of Mass Production with Massively Parallel Computing - Four Example Applications.
Stephen J. Smith
1991Sequential and Distributed Algorithms for the All Pairs Quickest Path Problem.
J. Ben Rosen, Guoliang Xue
1991Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps.
Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
1991Some Fast Parallel Algorithms for Parentheses Matching.
Sajal K. Das, Calvin Ching-Yuen Chen, Gene Lewis, Sushil K. Prasad
1991Storing Shortest Paths for a Polyhedron.
Jindong Chen, Yijie Han
1991Subtree Availability in Binary Tree Architectures.
Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney
1991The Interpolation-Based Bintree and its Application to Graphics.
Aris M. Ouksel, Anan Yaagoub
1991The Mean Value Approach to Performance Evaluation of Time-Stamp Ordering Algorithms.
Mohamed Eltoweissy, Nagwa M. El-Makky, M. Abougabal, Souheir A. Fouad
1991Undordered Tree Contraction.
Lih-Hsing Hsu, Jones J. J. Wang
1991What's Wrong With Formal Programming Methods?
Eric C. R. Hehner