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
 
Golan, Jonathan
University of Haifa
Haifa, Israel
 
   Reader Recommended
   Reviewer Selected
   Highlighted
Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 86 reviews

   
   Aggregation functions
Grabisch M., Marichal J., Mesiar R., Pap E., Cambridge University Press, New York, NY, 2009. 478 pp.  Type: Book (9780521519267)

Aggregation, the authors tell us, is the process of combining several numerical values to get a number that is, in some sense, representative of them all. Taking the arithmetic mean is a trivial example. We are all aware, of course, of...

Mar 18 2010  
   Transactions on rough sets IX
Peters J., Skowron A., Rybiński H. Springer-Verlag, New York, NY, 2008.  Type: Divisible Book

Pawlak originally developed rough sets to be used in the same situations as Zadeh’s better-known fuzzy sets [1]. Although they are less popular than fuzzy sets, they do have a devoted following and are proven to be a good too...

Dec 16 2009  
   Transactions on Petri nets and other models of concurrency I (Lecture Notes In Computer Science 5100)
Jensen K., Aalst W., Billington J. Springer-Verlag, Berlin, Heidelberg, 2008.  Type: Divisible Book

This volume contains 13 selected papers from the 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, which was held in Siedlce, Poland, in June 2007. They cover a wide range of topics...

Nov 2 2009  
   Introduction to interval analysis
Moore R., Kearfott R., Cloud M., Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009. 235 pp.  Type: Book (9780898716696)

Ramon Moore, one of the authors, introduced interval analysis almost a half-century ago. The idea behind it is very simple: when we state a numerical value for some computed or observed variable, say 4.357, we are really stating that t...

Jul 10 2009  
   Process algebra for parallel and distributed processing
Alexander M. (ed), Gardner W. (ed), Chapman & Hall/CRC, 2008. 440 pp.  Type: Book (9781420064865)

Process algebras have been around for about 30 years and have become an important tool for parallel processing, distributed processing, and embedded systems. This book contains 11 long essays on the applications of process algebras in ...

Jun 12 2009  
   Mathematical methods in computer science: essays in memory of Thomas Beth
Calmet J. (ed), Geiselmann W. (ed), Mller-Quade J. (ed), Springer Publishing Company, Incorporated, 2008. 191 pp.  Type: Book (9783540899938)

This volume contains the proceedings of a conference held in 2008 in memory of Thomas Beth, and reflects his mathematical and computer science interests. It contains 12 of the papers contributed to the conference, and two of the three ...

May 12 2009  
   Dependence logic: a new approach to independence friendly logic (London Mathematical Society Student Texts)
Väänänen J., Cambridge University Press, New York, NY, 2007. 236 pp.  Type: Book (9780521700153)

Dependence logic is an extension of first-order logic achieved by adding the notion of dependence. Instead of just allowing atomic formulas of the form fx=y, which states that the value of
Jan 9 2009  
   Cellular automata: a discrete view of the world (Wiley Series in Discrete Mathematics & Optimization)
Schiff J., Wiley-Interscience, 2007. 272 pp.  Type: Book, Reviews: (1 of 2)

In Schiff’s words, this book is “an introduction into the brave new world of cellular automata, hitting the highlights as the author sees them.” It is divided into six chapters: “Preliminaries,&a...

Nov 11 2008  
   Incidence structures and Stone-Priestley duality
Bekkali M., Pouzet M., Zhani D. Annals of Mathematics and Artificial Intelligence 49(1-4): 27-38, 2007.  Type: Article

Incidence structures are the key to much of the mathematical background of data analysis. In the classical (finite) case, one can think of them as a matrix with entries equal to 0 or 1, where a 1 in the (i,j...

Feb 20 2008  
   L-fuzzy covering relation
Šešelja B. Fuzzy Sets and Systems 158(22): 2456-2465, 2007.  Type: Article

In a partially ordered set X, an element y is said to cover an element x if y > x and there is no element z of X...

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