ISBN-10:
3540606882
ISBN-13:
9783540606888
Pub. Date:
12/20/1995
Publisher:
Springer Berlin Heidelberg
Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC '95 Pathumthani, Thailand, December 11 - 13, 1995. Proceedings / Edition 1

Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC '95 Pathumthani, Thailand, December 11 - 13, 1995. Proceedings / Edition 1

by Kanchana Kanchanasut, Jean-Jacques Levy

Paperback

Current price is , Original price is $119.0. You
Select a Purchase Option (1995)
  • purchase options
    $95.20 $119.00 Save 20% Current price is $95.2, Original price is $119. You Save 20%.
  • purchase options

Product Details

ISBN-13: 9783540606888
Publisher: Springer Berlin Heidelberg
Publication date: 12/20/1995
Series: Lecture Notes in Computer Science , #1023
Edition description: 1995
Pages: 417
Product dimensions: 6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Leapfrogging samplesort.- Spanning 2-trees.- Minimal linear invariants.- Parallel maximal matching on minimal vertex series parallel digraphs.- Efficient equality-testing and updating of sets.- Binary space partitions for sets of hyperrectangles.- Transformation of orthogonal term rewriting systems.- An automaton-driven frame disposal algorithm and its proof of correctness.- Labeled—-calculus and a generalised notion of strictness.- Preemption primitives in reactive languages.- Multi-action process algebra.- Complexity as a basis for comparing semantic models of concurrency.- Combinatory formulations of concurrent languages.- Constraints for free in concurrent computation.- Formalizing inductive proofs of message recovery in distributed systems.- Detecting distributed termination in the presence of node failure.- An extended gradient model for NUMA multiprocessor systems.- Efficient parallel permutation-based range-join algorithms on mesh-connected computers.- Pipelined band join in shared-nothing systems.- Inductive logic programming based on genetic algorithm.- The equivalence of the subsumption theorem and the refutation-completeness for unconstrained resolution.- Probabilistic logic programming and Bayesian networks.- Deriving and applying logic program transformers.- Performance of a data-parallel concurrent constraint programming system.- Formalizing inductive proofs of network algorithms.- TROM — An object model for reactive system development.- Duration calculus specification of scheduling for tasks with shared resources.- Trace specifications of non-deterministic multi-object modules.- ESP-MC: An experiment in the use of verification tools.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews

Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC '95 Pathumthani, Thailand, December 11 - 13, 1995. Proceedings 0 out of 5 based on 0 ratings. 0 reviews.