Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    gbv_59513081X
    Format: Online-Ressource (XII, 518 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540472391
    Series Statement: Lecture notes in computer science 241
    Content: Software Development Graphs a unifying concept for software development? -- Concurrent runtime checking of annotated Ada programs -- Recovery of noncurrent variables in source-level debugging of optimized code -- Automatic retargetable code generation: A new technique -- An implementation of OBJ2: An object-oriented language for abstract program specification -- Explicit representation of terms defined by counter examples -- A framework for intelligent backtracking in logic programs -- A generalization of Backus' FP -- Shortest-path motion -- Via assignment in single row routing -- Average-case analysis of the Modified Harmonic algorithm -- Covering minima and lattice point free convex bodies -- Binary decompositions and acyclic schemes -- Thin homogeneous sets of factors -- Irreducible polynomials over finite fields -- Basis reduction and evidence for transcendence of certain numbers -- A characterization of asynchronous message-passing -- Modular synthesis of deadlock-free control structures -- Distributed resource sharing in computer networks -- On proving communication closedness of distributed layers -- A distributed algorithm for edge-disjoint path problem -- Scheduling of hard real-time systems -- A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach -- Connectivity algorithms using rubber bands -- On simple and creative sets in NP -- Complexity of sufficient-completeness -- Sampling a population with a semi-random source -- An optimal parallel algorithm for dynamic expression evaluation and its applications -- Extension of the parallel nested dissection algorithm to path algebra problems -- On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies -- An efficient parallel algorithm for term matching.
    Note: Literaturangaben
    Additional Edition: ISBN 3540171797
    Additional Edition: ISBN 0387171797
    Additional Edition: ISBN 9783540171799
    Additional Edition: Erscheint auch als Druck-Ausgabe Foundations of software technology and theoretical computer science Berlin [u.a.] : Springer, 1986 ISBN 3540171797
    Additional Edition: ISBN 0387171797
    Language: English
    Keywords: Entscheidung bei mehrfacher Zielsetzung ; Gruppenentscheidung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages