Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues [[electronic resource] ] : Fourth International Conference on Intelligent Computing, ICIC 2008 Shanghai, China, September 15-18, 2008 Proceedings / / edited by De-Shuang Huang, Donald C. Wunsch, Daniel S. Levine, Kang-Hyun Jo |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XXVII, 1273 p.) |
Disciplina | 006.301 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Application software Pattern recognition systems Computer science Algorithms Artificial intelligence Programming Techniques Computer and Information Systems Applications Automated Pattern Recognition Theory of Computation Artificial Intelligence |
ISBN | 3-540-87442-9 |
Classificazione |
54.72
DAT 500f DAT 700f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Biological and Quantum Computing -- Intelligent Computing in Bioinformatics -- Computational Genomics and Proteomics -- Intelligent Computing in Signal Processing -- Intelligent Computing in Pattern Recognition -- Intelligent Computing in Communication -- Intelligent Agent and Web Applications -- Intelligent Fault Diagnosis -- Intelligent Control and Automation -- Intelligent Data Fusion and Security -- Intelligent Prediction and Time Series Analysis -- Natural Language Processing and Expert Systems -- Intelligent Image/Document Retrievals -- Network-Based Intelligence and Automation -- Intelligent Robot Systems Based on Vision Technology -- Computational Intelligence for Image Analysis. |
Record Nr. | UNISA-996465522903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues : Fourth International Conference on Intelligent Computing, ICIC 2008 Shanghai, China, September 15-18, 2008 Proceedings / / edited by De-Shuang Huang, Donald C. Wunsch, Daniel S. Levine, Kang-Hyun Jo |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XXVII, 1273 p.) |
Disciplina | 006.301 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Application software Pattern recognition systems Computer science Algorithms Artificial intelligence Programming Techniques Computer and Information Systems Applications Automated Pattern Recognition Theory of Computation Artificial Intelligence |
ISBN | 3-540-87442-9 |
Classificazione |
54.72
DAT 500f DAT 700f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Biological and Quantum Computing -- Intelligent Computing in Bioinformatics -- Computational Genomics and Proteomics -- Intelligent Computing in Signal Processing -- Intelligent Computing in Pattern Recognition -- Intelligent Computing in Communication -- Intelligent Agent and Web Applications -- Intelligent Fault Diagnosis -- Intelligent Control and Automation -- Intelligent Data Fusion and Security -- Intelligent Prediction and Time Series Analysis -- Natural Language Processing and Expert Systems -- Intelligent Image/Document Retrievals -- Network-Based Intelligence and Automation -- Intelligent Robot Systems Based on Vision Technology -- Computational Intelligence for Image Analysis. |
Record Nr. | UNINA-9910483797103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algebra and Coalgebra in Computer Science [[electronic resource] ] : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings / / edited by Alexander Kurz, Marina Lenisa |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XI, 457 p.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Models of Computation Theory of Computation |
ISBN | 3-642-03741-0 |
Classificazione |
DAT 500f
DAT 702f MAT 110f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algebraic Effects and Recursive Equations -- Adequacy for Infinitary Algebraic Effects (Abstract) -- Algebras for Parameterised Monads -- Kleene Monads: Handling Iteration in a Framework of Generic Effects -- Complete Iterativity for Algebras with Effects -- Semantics of Higher-Order Recursion Schemes -- Theory of Coalgebra -- Coalgebraic Components in a Many-Sorted Microcosm -- Complementation of Coalgebra Automata -- Characterising Behavioural Equivalence: Three Sides of One Coin -- Coinduction -- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) -- Circular Coinduction: A Proof Theoretical Foundation -- Bisimulation -- Approximating Labelled Markov Processes Again! -- Weak Bisimilarity Coalgebraically -- Coalgebraic Symbolic Semantics -- Relating Coalgebraic Notions of Bisimulation -- Traces, Executions and Schedulers, Coalgebraically -- Non-strongly Stable Orders Also Define Interesting Simulation Relations -- Stone Duality -- Stone Duality and the Recognisable Languages over an Algebra -- Free Heyting Algebras: Revisited -- Distributive Lattice-Structured Ontologies -- A Duality Theorem for Real C * Algebras -- Game Theory -- Conway Games, Coalgebraically -- A Semantical Approach to Equilibria and Rationality -- Graph Transformation -- Van Kampen Colimits as Bicolimits in Span -- Unfolding Grammars in Adhesive Categories -- Software Development Techniques -- Views on Behaviour Protocols and Their Semantic Foundation -- Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation -- Constructor-Based Institutions -- CALCO Tools Workshop -- DBtk: A Toolkit for Directed Bigraphs -- Constraint-Muse: A Soft-Constraint Based System for Music Therapy -- CIRC: A Behavioral Verification Tool Based on Circular Coinduction -- The Priced-Timed Maude Tool -- A Tool Proving Well-Definedness of Streams Using Termination Tools. |
Record Nr. | UNISA-996465311303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algebra and coalgebra in computer science : third international conference, CALCO 2009, Udine, Italy, September 7-10, 2009, proceedings / / Alexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.) |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
Descrizione fisica | 1 online resource (XI, 457 p.) |
Disciplina | 004.0151 |
Altri autori (Persone) |
KurzAlexander
LenisaMarina TarleckiAndrzej |
Collana | Lecture notes in computer science |
Soggetto topico |
Algebra - Data processing
Computational complexity Computer science Logic design |
ISBN | 3-642-03741-0 |
Classificazione |
DAT 500f
DAT 702f MAT 110f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algebraic Effects and Recursive Equations -- Adequacy for Infinitary Algebraic Effects (Abstract) -- Algebras for Parameterised Monads -- Kleene Monads: Handling Iteration in a Framework of Generic Effects -- Complete Iterativity for Algebras with Effects -- Semantics of Higher-Order Recursion Schemes -- Theory of Coalgebra -- Coalgebraic Components in a Many-Sorted Microcosm -- Complementation of Coalgebra Automata -- Characterising Behavioural Equivalence: Three Sides of One Coin -- Coinduction -- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) -- Circular Coinduction: A Proof Theoretical Foundation -- Bisimulation -- Approximating Labelled Markov Processes Again! -- Weak Bisimilarity Coalgebraically -- Coalgebraic Symbolic Semantics -- Relating Coalgebraic Notions of Bisimulation -- Traces, Executions and Schedulers, Coalgebraically -- Non-strongly Stable Orders Also Define Interesting Simulation Relations -- Stone Duality -- Stone Duality and the Recognisable Languages over an Algebra -- Free Heyting Algebras: Revisited -- Distributive Lattice-Structured Ontologies -- A Duality Theorem for Real C * Algebras -- Game Theory -- Conway Games, Coalgebraically -- A Semantical Approach to Equilibria and Rationality -- Graph Transformation -- Van Kampen Colimits as Bicolimits in Span -- Unfolding Grammars in Adhesive Categories -- Software Development Techniques -- Views on Behaviour Protocols and Their Semantic Foundation -- Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation -- Constructor-Based Institutions -- CALCO Tools Workshop -- DBtk: A Toolkit for Directed Bigraphs -- Constraint-Muse: A Soft-Constraint Based System for Music Therapy -- CIRC: A Behavioral Verification Tool Based on Circular Coinduction -- The Priced-Timed Maude Tool -- A Tool Proving Well-Definedness of Streams Using Termination Tools. |
Record Nr. | UNINA-9910484370903321 |
Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Computing and Combinatorics [[electronic resource] ] : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIV, 680 p.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Computer networks Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Programming Techniques Computer Communication Networks Discrete Mathematics in Computer Science Data Science Computer Graphics |
ISBN | 3-540-69733-0 |
Classificazione |
DAT 500f
DAT 537f MAT 050f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. |
Record Nr. | UNISA-996465846303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computing and combinatorics : 14th annual international conference, COCOON 2008 Dalian, China, June 27-29, 2008 : proceedings / / Xiaodong Hu, Jie Wang (eds) |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, : Springer, 2008 |
Descrizione fisica | 1 online resource (XIV, 680 p.) |
Disciplina | 004.0151 |
Altri autori (Persone) |
HuXiaodong
WangJie |
Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Soggetto topico |
Computer science
Combinatorial analysis |
ISBN | 3-540-69733-0 |
Classificazione |
DAT 500f
DAT 537f MAT 050f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. |
Altri titoli varianti | COCOON 2008 |
Record Nr. | UNINA-9910483048903321 |
Berlin, : Springer, 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Implementation and Application of Automata [[electronic resource] ] : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / / edited by Stavros Konstantinidis |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XIV, 358 p. 78 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Machine theory Bioinformatics Artificial intelligence—Data processing Information storage and retrieval systems Theory of Computation Formal Languages and Automata Theory Computational and Systems Biology Data Science Information Storage and Retrieval |
ISBN | 3-642-39274-1 |
Classificazione |
004
DAT 500f DAT 550f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Complexity of automata -- Compressed automata -- Counter automata -- Dictionary matching -- Edit distance -- Homing sequences -- Implementation -- Minimization of automata -- Model checking -- Parsing of regular expressions -- Partial word automata -- Picture languages -- Pushdown automata -- Queue automata -- Reachability analysis for software verification -- Restarting automata -- Transducers -- Tree automata -- Weighted automata -- XML streams. |
Record Nr. | UNISA-996466242303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Implementation and Application of Automata : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / / edited by Stavros Konstantinidis |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XIV, 358 p. 78 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Machine theory Bioinformatics Artificial intelligence—Data processing Information storage and retrieval systems Theory of Computation Formal Languages and Automata Theory Computational and Systems Biology Data Science Information Storage and Retrieval |
ISBN | 3-642-39274-1 |
Classificazione |
004
DAT 500f DAT 550f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Complexity of automata -- Compressed automata -- Counter automata -- Dictionary matching -- Edit distance -- Homing sequences -- Implementation -- Minimization of automata -- Model checking -- Parsing of regular expressions -- Partial word automata -- Picture languages -- Pushdown automata -- Queue automata -- Reachability analysis for software verification -- Restarting automata -- Transducers -- Tree automata -- Weighted automata -- XML streams. |
Record Nr. | UNINA-9910484900803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Infinity in Logic and Computation [[electronic resource] ] : International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers / / edited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIII, 139 p.) |
Disciplina | 004n/a |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computer programming Programming languages (Electronic computers) Computers Algorithms Mathematical logic Artificial Intelligence Programming Techniques Programming Languages, Compilers, Interpreters Theory of Computation Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages |
Soggetto genere / forma |
Cape Town (2007)
Kongress. |
ISBN | 3-642-03092-0 |
Classificazione |
004
DAT 500f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Nadia Busi (1968–2007) -- Symbolic Model Checking of Tense Logics on Rational Kripke Models -- Genetic Systems without Inhibition Rules -- Probabilistic Systems with LimSup and LimInf Objectives -- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata -- Towards Model-Checking Programs with Lists -- Representations of Numbers as :A Saddle Point Approach -- Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata -- Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions -- Is P?=?PSPACE for Infinite Time Turing Machines?. |
Record Nr. | UNISA-996465841803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Infinity in Logic and Computation : International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007 ; revised selected papers / / Margaret Archibald ... [et al.] (eds.) |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, c2009 |
Descrizione fisica | 1 online resource (XIII, 139 p.) |
Disciplina | 004n/a |
Altri autori (Persone) | ArchibaldMargaret |
Collana |
Lecture notes in artificial intelligence
Lecture notes in computer science |
Soggetto topico |
Logic programming
Machine theory |
ISBN | 3-642-03092-0 |
Classificazione |
004
DAT 500f SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Nadia Busi (1968–2007) -- Symbolic Model Checking of Tense Logics on Rational Kripke Models -- Genetic Systems without Inhibition Rules -- Probabilistic Systems with LimSup and LimInf Objectives -- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata -- Towards Model-Checking Programs with Lists -- Representations of Numbers as :A Saddle Point Approach -- Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata -- Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions -- Is P?=?PSPACE for Infinite Time Turing Machines?. |
Altri titoli varianti | ILC 2007 |
Record Nr. | UNINA-9910483480503321 |
Berlin ; ; Heidelberg, : Springer-Verlag, c2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|