Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Foundations of Computer Science [[electronic resource] ] : Potential-Theory-Cognition / / edited by Christian Freksa, Matthias Jantzen, Rüdiger Valk
| Foundations of Computer Science [[electronic resource] ] : Potential-Theory-Cognition / / edited by Christian Freksa, Matthias Jantzen, Rüdiger Valk |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 524 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Artificial intelligence Software engineering Computers and civilization Theory of Computation Artificial Intelligence Software Engineering/Programming and Operating Systems Computers and Society |
| ISBN | 3-540-69640-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The might of formulas and their limits -- Hardware — Software -- Defining discipline -- Computer science as cultural development -- Towards adjusting informatics education to information era -- Informatics and society: A curriculum for distance education -- Syntactic and semantic aspects of parallelism -- Unique fixpoints in complete lattices with applications to formal languages and semantics -- On abstract families of languages, power series, and elements -- Are there formal languages complete for SymSPACE(log n)? -- On twist-closed trios: A new morphic characterization of r.e. sets -- An automata approach to some problems on context-free grammars -- On aperiodic sets of Wang tiles -- Closure under complementation of logspace complexity classes - A survey - -- A relation between sparse and printable sets in NSPACE(log n) -- A foundation for computable analysis -- A computer scientist's view of life, the universe, and everything -- Calendars and chronologies -- A uniform approach to Petri Nets -- Observing partial order runs of Petri Nets -- Representation theorems for Petri Nets -- A remark on trace equations -- Verification of distributed algorithms with algebraic Petri Nets -- A short story on action refinement -- Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositionality and all that -- Discrete time analysis of a state dependent tandem with different customer types -- How distributed algorithms play the token game -- The asynchronous stack revisited: Rounds set the twilight reeling -- Online scheduling of continuous media streams -- Contribution to Goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification -- On the arrangement complexity of uniform trees -- A relational-functional integration for declarative programming -- Inside and outside the Chinese room -- Abstract structures in spatial cognition -- Spatial and temporal structures in cognitive processes -- Qualitative vs. Fuzzy representations of spatial distance -- What's a part? On formalizing part-whole relations -- SPOCK: A feasibility study on the completeness of parts lists -- Decision support systems with adaptive reasoning strategies -- Knowledge discovery in databases — An inductive logic programming approach -- The composition heuristic -- The job assignment problem: A study in parallel and distributed machine learning -- Self-improving behavior arbitration -- Neural networks for manipulator path planning -- Path planning using a subgoal graph -- A nonlinear markovian characterization of time series using neural networks -- Feature-based perception of semantic concepts -- Automatic detection of thesaurus relations for information retrieval applications -- InfoSphere ? -V: a new approach to 3D-visualization of information. |
| Record Nr. | UNINA-9910143472703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Computer Science [[electronic resource] ] : Potential-Theory-Cognition / / edited by Christian Freksa, Matthias Jantzen, Rüdiger Valk
| Foundations of Computer Science [[electronic resource] ] : Potential-Theory-Cognition / / edited by Christian Freksa, Matthias Jantzen, Rüdiger Valk |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 524 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Artificial intelligence Software engineering Computers and civilization Theory of Computation Artificial Intelligence Software Engineering/Programming and Operating Systems Computers and Society |
| ISBN | 3-540-69640-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The might of formulas and their limits -- Hardware — Software -- Defining discipline -- Computer science as cultural development -- Towards adjusting informatics education to information era -- Informatics and society: A curriculum for distance education -- Syntactic and semantic aspects of parallelism -- Unique fixpoints in complete lattices with applications to formal languages and semantics -- On abstract families of languages, power series, and elements -- Are there formal languages complete for SymSPACE(log n)? -- On twist-closed trios: A new morphic characterization of r.e. sets -- An automata approach to some problems on context-free grammars -- On aperiodic sets of Wang tiles -- Closure under complementation of logspace complexity classes - A survey - -- A relation between sparse and printable sets in NSPACE(log n) -- A foundation for computable analysis -- A computer scientist's view of life, the universe, and everything -- Calendars and chronologies -- A uniform approach to Petri Nets -- Observing partial order runs of Petri Nets -- Representation theorems for Petri Nets -- A remark on trace equations -- Verification of distributed algorithms with algebraic Petri Nets -- A short story on action refinement -- Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositionality and all that -- Discrete time analysis of a state dependent tandem with different customer types -- How distributed algorithms play the token game -- The asynchronous stack revisited: Rounds set the twilight reeling -- Online scheduling of continuous media streams -- Contribution to Goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification -- On the arrangement complexity of uniform trees -- A relational-functional integration for declarative programming -- Inside and outside the Chinese room -- Abstract structures in spatial cognition -- Spatial and temporal structures in cognitive processes -- Qualitative vs. Fuzzy representations of spatial distance -- What's a part? On formalizing part-whole relations -- SPOCK: A feasibility study on the completeness of parts lists -- Decision support systems with adaptive reasoning strategies -- Knowledge discovery in databases — An inductive logic programming approach -- The composition heuristic -- The job assignment problem: A study in parallel and distributed machine learning -- Self-improving behavior arbitration -- Neural networks for manipulator path planning -- Path planning using a subgoal graph -- A nonlinear markovian characterization of time series using neural networks -- Feature-based perception of semantic concepts -- Automatic detection of thesaurus relations for information retrieval applications -- InfoSphere ? -V: a new approach to 3D-visualization of information. |
| Record Nr. | UNISA-996466095503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 91 [[electronic resource] ] : 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991. Proceedings / / edited by Christian Choffrut, Matthias Jantzen
| STACS 91 [[electronic resource] ] : 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991. Proceedings / / edited by Christian Choffrut, Matthias Jantzen |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XIII, 551 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Combinatorics Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-47002-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polymorphism, parameterization and typing: An algebraic specification perspective -- Executable higher-order algebraic specifications -- Efficient memory access in large-scale computation -- l-occurrences of avoidable patterns -- Rational relations with bounded delay -- On the power of several queues -- On aperiodic trace languages -- Recognizable and rational languages of finite and infinite traces -- On the concatenation of infinite traces -- Tight RNC approximations to Max Flow -- A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms -- The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n -- Decision problems for term rewriting systems and recognizable tree languages -- Decidable sentences for context-free groups -- The owner concept for PRAMs -- Actors as a parallel programming model -- Average case analysis of unification algorithms -- Methodology for proving the termination of logic programs -- Polynomial size constant depth circuits with a limited number of negations -- Randomized polynomials, threshold circuits, and the polynomial hierarchy -- Computationally convincing proofs of knowledge -- Interactive proof systems and alternating time-space complexity -- Optimal tradeoffs between time and bit complexity in distributed synchronous rings -- Unconditional Byzantine Agreement with good majority -- A new compacting garbage-collection algorithm with a good average-case performance -- Bisimulation and action refinement -- Testing for unboundedness of Fifo channels -- Detection of deadlocks in an infinite family of nets -- Nondeterminism within P -- Structure and importance of logspace-MOD-classes -- Complexity classification of Truth Maintenance systems -- Reachability in reversible Free Choice systems -- Compositional generation of home states in free choice systems -- Bounded reductions -- Functional oracle queries as a measure of parallel time -- Optimal parallel recognition of bracket languages on hypercubes -- Constant queue routing on a mesh -- The complexity of the max word problem -- The expressive power of second order Horn logic -- Tight bounds on the path length of binary trees -- The random testability of the n-input AND gate -- An observational subset of first-order logic cannot specify the behaviour of a counter (extended abstract) -- Unfolding, procedural and fixpoint semantics of logic programs -- A modal semantics for the negation as failure and the closed world assumption rules -- The relview-system -- Geometry models design system ?POM -- The prospectra system -- Prototype of a verification tool -- IPG — An interactive parser generator -- A placement system for constrained blocks with flexible shapes -- Algebraic programm interpreter APREX2. |
| Record Nr. | UNISA-996465566003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 92 [[electronic resource] ] : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings / / edited by Alain Finkel, Matthias Jantzen
| STACS 92 [[electronic resource] ] : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings / / edited by Alain Finkel, Matthias Jantzen |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XVI, 628 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Numerical analysis Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Numerical Analysis |
| ISBN | 3-540-46775-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives -- The parallel complexity of tree embedding problems (extended abstract) -- A theory of strict P-completeness -- Fast and optimal simulations between CRCW PRAMs -- Suitability of the propositional temporal logic to express properties of real-time systems -- Axiomatizations of backtracking -- Joining k- and l-recognizable sets of natural numbers -- On the performance of networks with multiple busses -- Efficient algorithms for solving systems of linear equations and path problems -- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition -- A simplified technique for hidden-line elimination in terrains -- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes -- Equality and disequality constraints on direct subterms in tree automata -- Deterministic regular languages -- The extended low hierarchy is an infinite hierarchy -- Locally definable acceptance types for polynomial time machines -- The theory of the polynomial many-one degrees of recursive sets is undecidable -- A plane-sweep algorithm for finding a closest pair among convex planar objects -- Linear approximation of simple objects -- Language learning without overgeneralization -- The log-star revolution -- Separating counting communication complexity classes -- A nonlinear lower bound on the practical combinational complexity -- Characterizations of some complexity classes between ? 2 p and ? 2 p -- On complexity classes and algorithmically random languages -- New time hierarchy results for deterministic TMS -- Unconditional Byzantine agreement for any number of faulty processors -- Broadcasting in butterfly and debruijn networks -- Interval approximations of message causality in distributed executions -- On the approximability of the maximum common subgraph problem -- The complexity of colouring circle graphs -- Graph isomorphism is low for PP -- A simple linear time algorithm for triangulating three-colored graphs -- On locally optimal alignments in genetic sequences -- Secure commitment against a powerful adversary -- Communication efficient Zero-knowledge Proofs of knowledge -- Four results on randomized incremental constructions -- Enclosing many boxes by an optimal pair of boxes -- Performance driven k-layer wiring -- Synthesis for testability: Binary Decision Diagrams -- Compression and entropy -- Iterative devices generating infinite words -- On the factorization conjecture -- Conditional semi-Thue systems for presenting monoids -- A combinatorial bound for linear programming and related problems -- In-place linear probing sort -- Speeding up two string-matching algorithms -- The ANIGRAF system -- A programming language for symbolic computation of regular languages, automata and semigroups -- ?SPEED: a system for the specification and verification of microprocessors -- A discrete event simulator of communication algorithms in interconnection networks -- ALPHA DU CENTAUR: An environment for the design of systolic arrays -- Verification of communicating processes by means of automata reduction and abstraction -- Distributed system simulator (DSS) -- An interactive proof tool for process algebras -- SPECI90 A term rewriting and narrowing system. |
| Record Nr. | UNISA-996465639303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||