Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Fokkink, Wan Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 5 reviews    
  Combining user reputation and provenance analysis for trust assessment
Ceolin D., Groth P., Maccatrozzo V., Fokkink W., Van Hage W., Nottamkandath A. Journal of Data and Information Quality 7(1-2): 1-28, 2016.  Type: Article

The social engagement enabled by the Internet moved critical evaluation beyond the specialized few and distributed it in the hands of the common many. It is routine to evaluate the reputation of items in an online shopping context by t...
...
May 12 2016  
  Distributed algorithms: an intuitive approach
Fokkink W., The MIT Press, Cambridge, MA, 2013. 248 pp.  Type: Book (978-0-262026-77-2)

Distributed computing is a core concept in modern computing. Any large, well-known company, like Google, Apple, Microsoft, Yahoo, or Amazon, has thousands and thousands of computers all interconnected with gigabit networks passing mess...
...
Sep 4 2014  
   Modelling distributed systems (Texts in Theoretical Computer Science. An EATCS Series)
Fokkink W., Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 156 pp.  Type: Book (9783540739371)

The application of distributed systems is ubiquitous in almost every facet of today’s computerized life. Systems with various architecture configurations, including peer-to-peer (P2P), multi-tier (n-tier), ...
...
Nov 20 2008  
  Within ARM’s reach: compilation of left-linear rewrite systems via minimal rewrite systems
Fokkink W., Kamperman J., Walters P. ACM Transactions on Programming Languages and Systems 20(3): 679-706, 1998.  Type: Article

Term-rewriting systems constitute the execution models forfunctional languages and logic languages. In other words, theinterpretation of a program in such a language can be described by aterm-rewriting system. If one is able to compile...
...
Mar 1 1999  
  Termination modulo equations by abstract commutation with an application to iteration
Fokkink W., Zantema H. Theoretical Computer Science 177(2): 407-423, 1997.  Type: Article

An important research direction in the field of term rewriting systems is termination modulo equations. Term rewriting is often applied in the context of process algebra. In general, a complicating factor of rewriting in process algebr...
...
May 1 1998  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy