Algorithms, concurrency, and knowledge : 1995 Asian Computing Science Conference, ACSC '95, Pathumthani, Thailand, December 11-13, 1995 : proceedings
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 majority of the participating researchers come fr...
Enregistré dans:
| 企業作者: | |
|---|---|
| 其他作者: | , |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
1023 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms, concurrency, and knowledge, 1995 Asian Computing Science Conference, ACSC '95, Pathumthani, Thailand, December 11-13, 1995, proceedings, Kanchana Kanchanasut, Jean-Jacques Lévy, eds, Berlin, Springer, 1995, 1 vol. (X-410 p.), Lecture notes in computer science, 3-540-60688-2 • Algorithms, Concurrency and Knowledge, Texte imprimé, 9783662210741 |
書本目錄:
- 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.