Titlebook: Advances in Computing and Information - ICCI ‘91; International Confer Frank Dehne,Frantisek Fiala,Waldemar W. Koczkodaj Conference proceed

使糾纏

Computer Supported Cooperative Workted areas of research denoted Communications Software Engineering and Protocols, most corresponding problems are on their way to a solution. In this presentation, we will explore some similarities and differences between these research areas by giving examples of problems which appear to be tractabl

和平主義者

CSCW and Artificial Intelligenceerties of measures of presortedness rather than on the combinatorial properties of sorting algorithms. Using it, we obtain a practical adaptive sorting algorithm, optimal with respect to five important measures of presortedness and smoothly adaptive from .(.) to .(. log .) time for other common meas

Latency

cumulative

User Interfaces for CSCW Systems,nd has been studied for both graphs and matrices. The problem has important applications in large distributed processing systems and databases as well as communication theory. The technique presented here is used to provide a communication protocol for maximum throughput and concurrency control. We

思想

monologue

https://doi.org/10.1007/978-1-4471-2009-4me color if and only if those intervals do not overlap. Two versions of the problem are considered. For the first, we provide an O(k+n) time algorithm for k-coloring a maximum cardinality subset of the intervals. The best previous algorithm for this problem required time O(kn). In the second version

SYN

Computer Supported Cooperative Workmple proof of Chvàtal‘s art gallery theorem and improve or simplify a number of algorithms that deal with triangulated simple polygons. We describe two improved algorithms, both based on the degree sequence of the boundary vertices of the given triangulated simple polygon. The first is a linear-time

摻和

Computer Supported Cooperative Work . and we access an element . using the move-to-front heuristic to obtain a list .. If we insert . into an empty binary search tree to obtain . and insert . into an empty binary search tree to obtain ., then we can obtain . from . by accessing . using the move-to-root heuristic. We thus have a commu

BROW

盡責(zé)