|
|
Sold Out
Book Categories |
| Leapfrogging Samplesort | 1 | |
| Spanning 2-Trees | 10 | |
| Minimal Linear Invariants | 23 | |
| Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs | 34 | |
| Efficient Equality-Testing and Updating of Sets | 48 | |
| Binary Space Partitions for Sets of Hyperrectangles | 59 | |
| Transformation of Orthogonal Term Rewriting Systems | 73 | |
| An Automation-Driven Frame Disposal Algorithm and its Proof of Correctness | 88 | |
| Labeled [lambda]-Calculus and a Generated Notion of Strictness | 103 | |
| Preemption Primitives in Reactive Languages | 111 | |
| Multi-Action Process Algebra | 126 | |
| Complexity as a Basis for Comparing Semantic Models of Concurrency | 141 | |
| Combinatory Formulations of Concurrent Languages | 156 | |
| Constraints for Free in Concurrent Computation | 171 | |
| Formalizing Inductive Proofs of Message Recovery in Distributed Systems | 187 | |
| Detecting Distributed Termination in the Presence of Node Failure | 195 | |
| An Extended Gradient Model for NUMA Multiprocessor Systems | 210 | |
| Efficient Parallel Permutation-Based Range-Join Algorithms on Mesh-Connected Computers | 225 | |
| Pipelined Band Join in Shared-Nothing Systems | 239 | |
| Inductive Logic Programming Based on Genetic Algorithm | 254 | |
| The Equivalence of the Subsumption Theorem and the Refutation-completeness for Unconstrained Resolution | 269 | |
| Probabilistic Logic Programming and Bayesian Networks | 286 | |
| Deriving and Applying Logic Program Transformers | 301 | |
| Performance of a Data-Parallel Concurrent Constraint Programming System | 319 | |
| Formalizing Inductive Proofs of Network Algorithms | 335 | |
| TROM - An Object Model for Reactive System Development | 350 | |
| Duration Calculus Specification of Scheduling for Tasks with Shared Resources | 365 | |
| Trace Specifications of Non-deterministic Multi-object Modules | 381 | |
| ESP-MC: An Experiment in the Use of Verification Tools | 396 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Eric Yarnell
reviewed Algorithms, Concurrency and Knowledge on December 17, 2008
Algorithms, Concurrency and Knowledge
Pretty good introduction to algorithms. The writing style wasn't overly dry or boring. The explanations usually made sense, but occasionally felt lack in details. Some of the problem questions were quite difficult and sometimes seemed unrelated to the on page instruction material. The solutions manual helped me understand most of the difficult problems, but some were still ambiguous. This is a good textbook for use with a class, but perhaps not so great for self-learning unless you can find a community to further explain concepts and problems.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Algorithms, Concurrency and Knowledge
X
This Item is in Your Inventory
Algorithms, Concurrency and Knowledge
X
You must be logged in to review the productsX
X
X
Add Algorithms, Concurrency and Knowledge, This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995. The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the , Algorithms, Concurrency and Knowledge to the inventory that you are selling on WonderClubX
X
Add Algorithms, Concurrency and Knowledge, This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995. The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the , Algorithms, Concurrency and Knowledge to your collection on WonderClub |