000 04122nam a22004695i 4500
001 978-3-540-49262-7
003 DE-He213
005 20160624102041.0
007 cr nn 008mamaa
008 121227s1995 gw | s |||| 0|eng d
020 _a9783540492627
_9978-3-540-49262-7
024 7 _a10.1007/3-540-60688-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aAlgorithms, Concurrency and Knowledge
_h[electronic resource] :
_b1995 Asian Computing Science Conference, ACSC '95 Pathumthani, Thailand, December 11–13, 1995 Proceedings /
_cedited by Kanchana Kanchanasut, Jean-Jacques Lévy.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
300 _aXI, 417 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1023
505 0 _aLeapfrogging 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.
520 _aThis 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 from South-East Asian countries, but there is also a strong international component. The volume reflects research activities, particularly by Asian computer science researchers, in different areas. Special attention is paid to algorithms, knowledge representation, programming and specification languages, verification, concurrency, networking and distributed systems, and databases.
650 0 _aComputer science.
650 0 _aComputer software.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aKanchanasut, Kanchana.
_eeditor.
700 1 _aLévy, Jean-Jacques.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540606888
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1023
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-60688-2
942 _2EBK6729
_cEBK
999 _c36023
_d36023