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.
Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985. Proceedings / / edited by Jaques Calmet
| Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985. Proceedings / / edited by Jaques Calmet |
| Edizione | [1st ed. 1986.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
| Descrizione fisica | 1 online resource (VII, 417 p.) |
| Disciplina | 621.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Electrical engineering
Algorithms Electrical Engineering Communications Engineering, Networks Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-39855-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the arithmetics of Galoisfields and the like -- On strongly tactical codes -- Integer programming applied to eigenvector computation in a class of Markov processes -- A minimum system of generators for extended cyclic codes which are invariant under the affine group -- Some algebraic tools for error-correcting codes -- On computing the performance probabilities of Reed-Solomon codes -- Numerical experiments related to the covering radius of some first order Reed-Muller codes -- Several aspects of problems encountered in coding applications -- Software simulation of data transmission using error-correcting codes, through an awgn channel -- Algebraic methods for constructing asymmetric cryptosystems -- Covering radii of even subcodes of t-dense codes -- Orthogonal transform encoding of cyclic codes -- On s-sum-sets and projective codes -- Pseudo-triple-sum-sets and association schemes -- A decoding algorithm for linear codes -- The finite Fourier-transform and theta functions -- Recent results on coding and algebraic geometry -- Some properties of elliptic codes over a field of characteristic 2 -- Self-dual codes 2n circulant over Fq (q=2r) -- Automorphisms and isometries of some modular algebras -- A lower bound for the bilinear complexity of some semisimple lie algebras -- On computational complexity of some algebraic curves over finite fields -- Some group presentations and enforcing the associative law -- Fast computation of linear finite-dimensional operators over arbitrary rings -- Quantifier elimination for real closed fields -- Efficient decision algorithms for locally finite theories -- The algorithmic structure of sl(2,k) -- Optimal algorithms for finite dimensional simply generated algebras -- On a little but useful algorithm -- Computation of independent units in number fields by Dirichlet's method -- Some upper bounds for the multiplicity of an autoreduced subset of N m and their applications -- Exact computation of the characteristic polynomial of an integer matrix -- An analysis of the Krönecker algorithm for factorization of algebraic polynomials -- Polynomial factorization over ?[X] -- The L-machine: An attempt at parallel hardware for symbolic computation -- An interactive graphical interface for symbolic algebra systems -- Groebner bases for non-commutative polynomial rings -- Extending the binary GCD algorithm -- Integration of rational functions in SAC-2 -- Heuristic bivariate lifting -- Optimal evaluation of algebraic expressions -- On deleting links in semantic graphs -- Erratum. |
| Record Nr. | UNISA-996465942603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Artificial Intelligence and Symbolic Computation [[electronic resource] ] : 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, Proceedings / / edited by Jaques Calmet, Tetsuo Ida, Dongming Wang
| Artificial Intelligence and Symbolic Computation [[electronic resource] ] : 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, Proceedings / / edited by Jaques Calmet, Tetsuo Ida, Dongming Wang |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIII, 269 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer science—Mathematics Numerical analysis Mathematical logic Artificial Intelligence Symbolic and Algebraic Manipulation Numeric Computing Discrete Mathematics in Computer Science Mathematical Logic and Formal Languages |
| ISBN | 3-540-39730-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Interactive Mathematical Documents -- Algebra and Geometry -- An Inductive Inference System and Its Rationality -- Semantic Guidance for Saturation Provers -- Contributed Papers -- Labeled @-Calculus: Formalism for Time-Concerned Human Factors -- Enhanced Theorem Reuse by Partial Theory Inclusions -- Extension of First-Order Theories into Trees -- The Confluence Problem for Flat TRSs -- Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer -- A New Definition for Passivity and Its Relation to Coherence -- A Full System of Invariants for Third-Order Linear Partial Differential Operators -- An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial -- Quantifier Elimination for Quartics -- On the Mixed Cayley-Sylvester Resultant Matrix -- Implicitization of Rational Curves -- Operator Calculus Approach to Solving Analytic Systems -- Solving Dynamic Geometric Constraints Involving Inequalities -- Constraints for Continuous Reachability in the Verification of Hybrid Systems -- Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances -- Finding Relations Among Linear Constraints -- A Search Engine for Mathematical Formulae -- Hierarchical Representations with Signatures for Large Expression Management. |
| Record Nr. | UNISA-996466152003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Artificial Intelligence and Symbolic Mathematical Computation [[electronic resource] ] : International Conference, AISMC-3, Steyr, Austria, September, 23 - 25, 1996. Proceedings / / edited by Jaques Calmet, John A. Campbell, Jochen Pfalzgraf
| Artificial Intelligence and Symbolic Mathematical Computation [[electronic resource] ] : International Conference, AISMC-3, Steyr, Austria, September, 23 - 25, 1996. Proceedings / / edited by Jaques Calmet, John A. Campbell, Jochen Pfalzgraf |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (VIII, 384 p.) |
| Disciplina | 006.3/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Computer science—Mathematics Algorithms Mathematical logic Computational complexity Artificial Intelligence Theory of Computation Symbolic and Algebraic Manipulation Mathematical Logic and Formal Languages Complexity |
| ISBN | 3-540-70740-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Symbolic computation and teaching -- Analytica — An experiment in combining theorem proving and symbolic computation -- Document recognition, semantics, and symbolic reasoning in reverse engineering of software -- Compromised updates in labelled databases -- An inference engine for propositional two-valued logic based on the radical membership problem -- Programming by demonstration: A machine learning approach to support skill acquision for robots -- Knowledge-based information processing in manufacturing cells — The present and the future -- Calculi for qualitative spatial reasoning -- Combining local consistency, symbolic rewriting and interval methods -- Proof transformation for non-compatible rewriting -- PATCH Graphs: An efficient data structure for completion of finitely presented groups -- Measuring the likely effectiveness of strategies -- A new approach on solving 3-satisfiability -- Geometry machines: From AI to SMC -- Interactive Theorem Proving and finite projective planes -- Towards modelling the topology of homogeneous manifolds by means of symbolic computation -- Solving geometrical constraint systems using CLP based on linear constraint solver -- Towards a sheaf semantics for cooperating agents scenarios -- Data types in subdefinite models -- On theorem-proving in Horn theories with built-in algebras -- Backward reasoning in systems with cut -- Soundness and completeness versus lifting property -- Reasoning with preorders and dynamic sorts using free variable tableaux. |
| Record Nr. | UNISA-996465858403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||