Advances in Computing and Information - ICCI '91: International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991. ProceedingsSpringer Science & Business Media, 1991. gada 7. maijs - 744 lappuses This volume contains papers presented at the Third International Conference on Computing and Information, ICCI '91, held at Carleton University in Ottawa, Canada, May 27-29, 1991. The conference was organized by the School of Computer Science at Carleton University, and was sponsored by the Natural Sciences and Engineering Research Council of Canada (NSERC) and Carleton University. ICCI '91 was an international forum for the presentation of original results in research, development, and applications in computing and information processing. The conference was aimed at both practitioners and theoreticians, and was organized into five streams: - Algorithms and complexity, - Databases and information systems, - Parallel processing and systems, - Distributed computing and systems, - Expert systems, artificial intelligence. This volume contains three invited papers, by E.C.R. Hehner, R.L. Probert, and S.J. Smith, and 71 selected papers. |
Saturs
Whats Wrong With Formal Programming Methods? | 2 |
COMPUTER SCIENCE AND COMMUNICATIONS PROTOCOLS RESEARCH RELATIONSHIPS | 24 |
WITH MASSIVELY PARALLEL COMPUTING Four Example Applications | 33 |
2 Algorithms and Complexity | 43 |
ON THE QUICKEST PATH PROBLEM Extended Abstract | 44 |
Practical Adaptive Sorting | 47 |
LOWER BOUNDS FOR ALGEBRAIC COMPUTATION TREES OF FUNCTIONS WITH FINITE DOMAINS | 55 |
APPROXIMATION ALGORITHMS FOR THE BANDWIDTH MINIMIZATION PROBLEM FOR A LARGE CLASS OF TREES | 66 |
Properties and Recognition | 393 |
Increasing Communication Bandwidth on Hypercube | 401 |
PROGRAMMING A PARALLEL SORT USING DISTRIBUTED PROCEDURE CALLS | 413 |
A Note on Offline Permutation Routing on a MeshConnected Processor Array | 416 |
A FULLYPIPELINED SOLUTIONS CONSTRUCTOR FOR DYNAMIC PROGRAMMING PROBLEMS | 419 |
On the FaultTolerance of QuasiMinimal Cayley Networks Extended Abstract | 429 |
Some Fast Parallel Algorithms for Parentheses Matching | 441 |
A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem | 453 |
The InterpolationBased Bintree and Its Application to Graphics | 78 |
On the kcoloring of Intervals Extended Abstract | 88 |
Structural and Algorithmic Results | 100 |
A Relationship Between SelfOrganizing Lists and Binary Search Trees | 109 |
How Costly Can RedBlack Trees Be? | 115 |
Balance in AVL Trees | 125 |
A TIGHT LOWER BOUND FOR SELECTION IN SORTED X+Y | 132 |
AND CAN BE IMPLEMENTED IN LINEAR TIME IN THE AVERAGE CASE | 137 |
Generating Random Graphs Efficiently | 147 |
LINEAR EXTENSIONS WITH BACKTRACKING | 159 |
Storing Shortest Paths for a Polyhedron | 167 |
3 Databases and Information Systems | 179 |
An Improved Join Dependency For Efficient Constraint Checking | 180 |
On the Power of QueryIndependent Compilation | 183 |
Parallel Transitive Closure Computation in Highly Scalable Multiprocessors | 195 |
METHODS AND TOOLS FOR INTEGRATING DATABASE SYSTEMS AND OBJECTORIENTED PROGRAMMING SYSTEMS | 205 |
Incremental Database Design Revisited | 217 |
Partial Document Ranking by Heuristic Methods | 229 |
Context Inheritance and Content Inheritance in an ObjectOriented Data Model | 238 |
GRAPHICAL SPECIFICATION OF RECURSIVE QUERIES | 250 |
On Designing Relational Database Schemes for Efficient Query Processing | 262 |
THE MEAN VALUE APPROACH TO PERFORMANCE EVALUATION OF TIMESTAMP ORDERING ALGORITHMS | 274 |
Budi Yuwono Dik Lun Lee | 286 |
4 Parallel Processing and Systems | 297 |
SUBTREE AVAILABILITY IN BINARY TREE ARCHITECTURES | 310 |
An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem | 321 |
A FaultTolerant Binary Tree Architecture | 333 |
ConflictFree Sorting Algorithms under SingleChannel and MultiChannel Broadcast Communication Models | 348 |
Parallel Routing and Sorting on the Pancake Network | 358 |
Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs | 381 |
A Restructuring Method For Parallel Compilation | 460 |
Sequential and Distributed Algorithms for the All Pairs Quickest Path Problem | 469 |
An Efficient Approximation Algorithm for Hypercube Scheduling | 472 |
An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals | 482 |
AN EFFICIENT MULTIPROCESSOR ARCHITECTURE FOR IMAGE PROCESSING IN VLSI | 494 |
5 Distributed Computing and Systems | 507 |
A Formal Description of the IC Model of Parallel Computation | 518 |
AN EFFICIENT ALGORITHM FOR QUIESCENCE DETECTION IN A DISTRIBUTED SYSTEM | 530 |
Interval Arithmetic for Computing Performance Guarantees in ClientServer Software | 533 |
HARD REALTIME DISTRIBUTED SYSTEMS | 545 |
A Design and Modeling Environment to Develop Realtime Distributed Software Systems | 557 |
ON THE MANAGMENT OF REMOTE PROCEDURE CALL TRANSACTIONS | 569 |
A Linear Complexity Solution With Unbounded TimeStamps | 580 |
A DISTRIBUTED SCHEDULING ALGORITHM FOR HETEROGENEOUS REALTIME SYSTEMS | 586 |
A distributed solution to the kout ofM resources allocation problem | 597 |
Efficient Distributed Resource Scheduling for Rdaptiue RealTime Operation Support | 608 |
| 626 | |
6 Expert Systems Artificial Intelligence | 639 |
A chemical reactor selection expert system created by training an artificial neural network | 643 |
A Modeling Technique for Generating Casual Explanations of Physical Systems | 655 |
PLANNING IN CONCEPTUAL NETWORKS | 667 |
EMPIRICAL STUDY OF THE MEANING OF THE HEDGE VERY | 670 |
a logical approach | 673 |
NEURAL NETWORK PROCESSING ELEMENTS AS A NEW GENERATION OF FLIPFLOPS | 685 |
A ProofTheoretic Framework for Nonmonotonic Reasoning and Logic Programming | 697 |
| 707 | |
A framework for variableresolution vision | 719 |
AN RMS FOR TEMPORAL REASONING WITH ABSTRACTION | 731 |
AUTHOR INDEX | 743 |
Citi izdevumi - Skatīt visu
Advances in Computing and Information - ICCI '91 Frank Dehne,Frantisek Fiala,Waldemar W. Koczkodaj Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
abstract assume AVL trees behavior binary tree bincode bound compact hypercubes complexity Computer Science consider database scheme defined deletion denote distributed document edge efficient elements endpoint Euler path evaluation example execution fault fault-tolerant Figure function graph heuristic hypercube IEEE implementation input integer intervals iteration Lemma linear logic maximal clique maximum merge Merge Sort method move-to-front heuristic neural networks nodes number of nodes O(log obtained operations optimal output paper PAR-TC parallel algorithms partition performance permutation permutation graph predicate problem Proc processors Proof query r₁ r₂ real-time recursive red-black trees relation represented retrieval scheduling segment semantics sequence server shortest path signature sorting algorithm specification star graphs step subtree task Theorem transaction transitive closure triangle tuple update variable vertex vertices visibility pair weight