| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 15
reviews
|
|
|
 |
|
|
|
|
Conditional safety certification of open adaptive systems
Schneider D., Trapp M. ACM Transactions on Autonomous and Adaptive Systems 8(2): 1-20, 2013. Type: Article
Safety is an important issue in the use of computer systems, and particularly in safety-critical applications. However, it is generally investigated in static systems, and therefore the resulting solutions do not function as well in th...
|
Sep 18 2013 |
|
|
|
|
|
|
Abstract interdomain security assertions: a basis for extra-grid virtual organizations
Carpenter B., Janson P. IBM Systems Journal 43(4): 689-701, 2004. Type: Article
Carpenter and Janson propose an abstract method to deal with the security policy between different and heterogeneous security mechanisms. They detail a number of key points and requirements that must satisfy the security system of a vi...
|
Oct 24 2005 |
|
|
|
|
|
|
Elements of distributed computing
Garg V., John Wiley & Sons, Inc., New York, NY, 2002. 423 pp. Type: Book (9780471036005), Reviews: (1 of 2)
In the last few years, the growth of network and distributed technology has triggered a rapid evolution in the need for distributed systems foundations. This book is a good reference for distributed algorithms. It is a collection of s...
|
Feb 5 2003 |
|
|
|
|
|
|
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks
Chen Y., Welch J. Discrete algorithms and methods for mobile computing and communications (Proceedings of the workshop, Atlanta, Georgia, USA, 2002. Type: Proceedings
A self-stabilizing algorithm for mutual exclusion in mobile networks is developed in this paper. The algorithm is based on moving tokens on a cycle connecting all nodes of the graph. However, the topology of the graph cannot change wh...
|
Nov 13 2002 |
|
|
|
|
|
|
Transact-SQL cookbook
Špetiš A., Gennick J., O’Reilly & Associates, Inc., Sebastopol, CA, 2002. 282 pp. Type: Book (9781565927568)
Transact-SQL is the version of structured query language (SQL) used in Microsoft’s SQL Server (and, to some extent, in Sybase). The book is targeted at people with some knowledge of SQL. It gives hints about how to write que...
|
Jul 24 2002 |
|
|
|
|
|
|
Bisimilarity in term graph rewriting
Ariola Z., Klop J., Plump D. Information and Computation 156(1-2): 2-24, 2000. Type: Article
The authors investigate confluence properties of graph rewriting systems. They characterize confluence and termination of term graph rewriting modulo an equivalence which they call bisimilarity....
|
Aug 1 2000 |
|
|
|
|
|
|
The generating power of total deterministic tree transducer
Maneth S. Information and Computation 147(2): 111-144, 1998. Type: Article
This paper deals with the generating power of tree transducers.Maneth proves that attributed tree transducers and attribute grammarsgenerate the same class of term languages. In particular, heinvestigates top-down tree transducers. A h...
|
Aug 1 1999 |
|
|
|
|
|
|
Choosing a database for your Web site
Ashenfelter J., John Wiley & Sons, Inc., New York, NY, 1999. Type: Book (9780471296904)
In this guide to designing and developing databases for Web sites, Ashenfelter provides background and information on database technology, and supplies frameworks for putting databases on the Web. Unlike many other books, which deal wi...
|
Mar 1 1999 |
|
|
|
|
|
|
On treewidth and minimum fill-in of asteroidal triple-free graphs
Kloks T., Kratsch D., Spinrad J. Theoretical Computer Science 175(2): 309-335, 1997. Type: Article
Efficient algorithms for computing the treewidth, pathwidth, minimum fill-in, and interval graph completion are developed for asteroidal triple-free graphs. These algorithms are polynomial for any subset of asteroidal triple-free graph...
|
Oct 1 1998 |
|
|
|
|
|
|
Algorithms for the certified write-all problem
Anderson R. (ed), Woll H. SIAM Journal on Computing 26(5): 1277-1283, 1997. Type: Article
The authors improve the complexity bounds of the certified write-all problem. This problem is important in asynchronous computation. The main result of the paper is that, for any &egr; > 0, there exists an...
|
Aug 1 1998 |
|
|
|
|
|
| |
|
|
| |
|
|
