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.
Cellular Automata [[electronic resource] ] : 13th International Conference on Cellular Automata for Research and Industry, ACRI 2018, Como, Italy, September 17–21, 2018, Proceedings / / edited by Giancarlo Mauri, Samira El Yacoubi, Alberto Dennunzio, Katsuhiro Nishinari, Luca Manzoni
| Cellular Automata [[electronic resource] ] : 13th International Conference on Cellular Automata for Research and Industry, ACRI 2018, Como, Italy, September 17–21, 2018, Proceedings / / edited by Giancarlo Mauri, Samira El Yacoubi, Alberto Dennunzio, Katsuhiro Nishinari, Luca Manzoni |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XV, 528 p. 204 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Computers, Special purpose Computer networks Data protection Cryptography Data encryption (Computer science) Artificial Intelligence Special Purpose and Application-Based Systems Computer Communication Networks Data and Information Security Cryptology |
| ISBN | 3-319-99813-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Biological Systems Modeling -- Simulation and Other Applications of CA -- Multi-agent Systems -- Pedestrian and Traffic Dynamics -- Synchronization and Control -- Theory and Cryptography -- Asynchronous Cellular Automata -- Crowds, Traffic and Cellular Automata. |
| Record Nr. | UNISA-996466368003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cellular Automata [[electronic resource] ] : 13th International Conference on Cellular Automata for Research and Industry, ACRI 2018, Como, Italy, September 17–21, 2018, Proceedings / / edited by Giancarlo Mauri, Samira El Yacoubi, Alberto Dennunzio, Katsuhiro Nishinari, Luca Manzoni
| Cellular Automata [[electronic resource] ] : 13th International Conference on Cellular Automata for Research and Industry, ACRI 2018, Como, Italy, September 17–21, 2018, Proceedings / / edited by Giancarlo Mauri, Samira El Yacoubi, Alberto Dennunzio, Katsuhiro Nishinari, Luca Manzoni |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XV, 528 p. 204 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Computers, Special purpose Computer networks Data protection Cryptography Data encryption (Computer science) Artificial Intelligence Special Purpose and Application-Based Systems Computer Communication Networks Data and Information Security Cryptology |
| ISBN | 3-319-99813-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Biological Systems Modeling -- Simulation and Other Applications of CA -- Multi-agent Systems -- Pedestrian and Traffic Dynamics -- Synchronization and Control -- Theory and Cryptography -- Asynchronous Cellular Automata -- Crowds, Traffic and Cellular Automata. |
| Record Nr. | UNINA-9910349411203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 201 p. 48 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer simulation Computer networks Computer science—Mathematics Mathematical statistics Machine theory Theory of Computation Computer Modelling Computer Communication Networks Probability and Statistics in Computer Science Formal Languages and Automata Theory |
| ISBN | 3-319-58631-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Two Dimensional Cellular Automata and Computational Complexity -- Fixed Points in Boolean Networks -- Contents -- Invited Papers -- Strict Asymptotic Nilpotency in Cellular Automata -- 1 Introduction -- 2 Nilpotency on Multidimensional Full Shifts -- 3 Nilpotency from a Subset of Configurations -- 4 Nilpotency on Multidimensional Subshifts -- 4.1 SFTs -- 4.2 Sofics (and Beyond) -- 5 Nilpotency as Uniform Convergence to a Point -- 6 Cellular Automata on Graphs and Groups -- 6.1 What Works on General Groups? -- 7 CA with Very Sparse Spacetime Diagrams -- References -- Regular Papers -- Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties -- 1 Introduction -- 2 Preliminaries -- 3 Two-Dimensional Codes -- 4 Infinite Strong Prefix Codes -- 5 Measure of Two-Dimensional Languages and Codes -- References -- Restricted Binary Strings and Generalized Fibonacci Numbers -- 1 Introduction -- 2 A Simple Bijection and Some Applications -- 3 Number of 1's in the Strings of Fn(k) -- 4 Conclusion -- References -- Von Neumann Regular Cellular Automata -- 1 Introduction -- 2 Regular Cellular Automata -- 3 Regular Finite Cellular Automata -- 4 Regular Linear Cellular Automata -- References -- Enumerative Results on the Schröder Pattern Poset -- 1 Introduction -- 2 The Covering Relation in the Schröder Pattern Poset -- 3 Enumerative Results on Pattern Avoiding Schröder Paths -- 3.1 The Pattern (UD)k -- 3.2 The Pattern Uk Dk -- 3.3 The Pattern H2 k -- 3.4 The Pattern UH2 k-1D -- 3.5 The Pattern H2 k-1UD -- 4 Suggestions for Further Work -- References -- Canonical Form of Gray Codes in N-cubes -- 1 Introduction -- 2 Canonical Form of Gray Codes -- 2.1 Isomorphic Cycles -- 2.2 Preliminary Tools -- 2.3 Canonical Form -- 2.4 Examples of Application of C.
2.5 Discussion over the Interest of the Canonical Form -- 3 Balanced Gray Codes Generation Algorithm -- 4 Application -- 4.1 Validation of the Canonical Form and the Generation Algorithm -- 4.2 Application of the Balanced Gray Code Generation Algorithm -- 5 Conclusion -- References -- Equicontinuity and Sensitivity of Nondeterministic Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Cellular Automata -- 2.2 Nondeterministic Cellular Automata -- 3 Equicontinuity -- 4 Sensitivity -- 5 Transitivity -- 6 Conclusions -- References -- Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules -- 1 Introduction -- 2 Definitions -- 3 First Steps in the Space of Diploids -- 3.1 Experimental Protocol -- 3.2 Mixtures with the Null Rule (ECA 0) -- 3.3 Mixtures with the Identity Rule: -asynchronous ECA -- 3.4 Mixtures with the Inversion Rule (ECA 51) -- 4 Discussion -- References -- On the Computational Complexity of the Freezing Non-strict Majority Automata -- 1 Introduction -- 2 Preliminaries -- 3 A Characterization of Stable Sets -- 4 The Algorithm -- 5 Conclusion -- References -- Distortion in One-Head Machines and Cellular Automata -- 1 Introduction -- 2 Definitions -- 2.1 Subshifts and Cellular Automata -- 2.2 Neighborhoods and Radii -- 2.3 Distortion -- 3 Distorted One-Head Machines -- 3.1 One-Head Machines -- 3.2 Speed Trichotomy -- 3.3 Aperiodic Machines -- 3.4 Distortion on Sofic Shifts -- 3.5 Undecidability of Distortion -- 4 Unbalanced Distortion in General Subshifts -- 5 Future Work -- References -- Fast One-Way Cellular Automata with Reversible Mealy Cells -- 1 Introduction -- 2 Preliminaries and Definitions -- 3 The Computational Capacity of One-Way Mealy Cellular Automata with Weakly Reversible Cells -- 4 Reversible One-Way Partitioned Cellular Automata -- 5 Conclusions -- References. Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Definitions -- 2.2 Latin Squares Generated by Cellular Automata -- 3 Main Results -- 4 Enumeration of Pairwise Balanced Bipermutive Rules -- 5 Conclusions -- References -- Filling Curves Constructed in Cellular Automata with Aperiodic Tiling -- 1 Introduction -- 2 Constructions and Fillings -- 2.1 Cellular Automata -- 2.2 Tile Set -- 3 Aperiodic Tile Set -- 3.1 From Tile Set Determinism to Cellular Automaton -- 3.2 A NW-Deterministic Aperiodic Tile Set -- 4 Aperiodic Filling -- 4.1 Linear Functions -- 4.2 Over-Logarithmic Growth Functions -- 5 Conclusions and Perspectives -- References -- Some Computational Limits of Trellis Automata -- 1 Introduction -- 2 Trellis Automaton -- 3 Factors Diagram for a Language -- 4 Trellis Automaton Patterns and Language Patterns -- 5 Counting Argument -- 6 Some Non Trellis Language -- 7 Conclusion -- References -- Turing-Completeness of Asynchronous Non-camouflage Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Asynchronous CA -- 2.2 Requirements -- 2.3 Priese System -- 3 Proposing Asynchronous Non-camouflage CA -- 3.1 Proposed CA M -- 3.2 Simulation of s-automaton -- 4 Discussion -- References -- Author Index. |
| Record Nr. | UNISA-996466308903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 201 p. 48 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer simulation Computer networks Computer science—Mathematics Mathematical statistics Machine theory Theory of Computation Computer Modelling Computer Communication Networks Probability and Statistics in Computer Science Formal Languages and Automata Theory |
| ISBN | 3-319-58631-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Two Dimensional Cellular Automata and Computational Complexity -- Fixed Points in Boolean Networks -- Contents -- Invited Papers -- Strict Asymptotic Nilpotency in Cellular Automata -- 1 Introduction -- 2 Nilpotency on Multidimensional Full Shifts -- 3 Nilpotency from a Subset of Configurations -- 4 Nilpotency on Multidimensional Subshifts -- 4.1 SFTs -- 4.2 Sofics (and Beyond) -- 5 Nilpotency as Uniform Convergence to a Point -- 6 Cellular Automata on Graphs and Groups -- 6.1 What Works on General Groups? -- 7 CA with Very Sparse Spacetime Diagrams -- References -- Regular Papers -- Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties -- 1 Introduction -- 2 Preliminaries -- 3 Two-Dimensional Codes -- 4 Infinite Strong Prefix Codes -- 5 Measure of Two-Dimensional Languages and Codes -- References -- Restricted Binary Strings and Generalized Fibonacci Numbers -- 1 Introduction -- 2 A Simple Bijection and Some Applications -- 3 Number of 1's in the Strings of Fn(k) -- 4 Conclusion -- References -- Von Neumann Regular Cellular Automata -- 1 Introduction -- 2 Regular Cellular Automata -- 3 Regular Finite Cellular Automata -- 4 Regular Linear Cellular Automata -- References -- Enumerative Results on the Schröder Pattern Poset -- 1 Introduction -- 2 The Covering Relation in the Schröder Pattern Poset -- 3 Enumerative Results on Pattern Avoiding Schröder Paths -- 3.1 The Pattern (UD)k -- 3.2 The Pattern Uk Dk -- 3.3 The Pattern H2 k -- 3.4 The Pattern UH2 k-1D -- 3.5 The Pattern H2 k-1UD -- 4 Suggestions for Further Work -- References -- Canonical Form of Gray Codes in N-cubes -- 1 Introduction -- 2 Canonical Form of Gray Codes -- 2.1 Isomorphic Cycles -- 2.2 Preliminary Tools -- 2.3 Canonical Form -- 2.4 Examples of Application of C.
2.5 Discussion over the Interest of the Canonical Form -- 3 Balanced Gray Codes Generation Algorithm -- 4 Application -- 4.1 Validation of the Canonical Form and the Generation Algorithm -- 4.2 Application of the Balanced Gray Code Generation Algorithm -- 5 Conclusion -- References -- Equicontinuity and Sensitivity of Nondeterministic Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Cellular Automata -- 2.2 Nondeterministic Cellular Automata -- 3 Equicontinuity -- 4 Sensitivity -- 5 Transitivity -- 6 Conclusions -- References -- Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules -- 1 Introduction -- 2 Definitions -- 3 First Steps in the Space of Diploids -- 3.1 Experimental Protocol -- 3.2 Mixtures with the Null Rule (ECA 0) -- 3.3 Mixtures with the Identity Rule: -asynchronous ECA -- 3.4 Mixtures with the Inversion Rule (ECA 51) -- 4 Discussion -- References -- On the Computational Complexity of the Freezing Non-strict Majority Automata -- 1 Introduction -- 2 Preliminaries -- 3 A Characterization of Stable Sets -- 4 The Algorithm -- 5 Conclusion -- References -- Distortion in One-Head Machines and Cellular Automata -- 1 Introduction -- 2 Definitions -- 2.1 Subshifts and Cellular Automata -- 2.2 Neighborhoods and Radii -- 2.3 Distortion -- 3 Distorted One-Head Machines -- 3.1 One-Head Machines -- 3.2 Speed Trichotomy -- 3.3 Aperiodic Machines -- 3.4 Distortion on Sofic Shifts -- 3.5 Undecidability of Distortion -- 4 Unbalanced Distortion in General Subshifts -- 5 Future Work -- References -- Fast One-Way Cellular Automata with Reversible Mealy Cells -- 1 Introduction -- 2 Preliminaries and Definitions -- 3 The Computational Capacity of One-Way Mealy Cellular Automata with Weakly Reversible Cells -- 4 Reversible One-Way Partitioned Cellular Automata -- 5 Conclusions -- References. Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Definitions -- 2.2 Latin Squares Generated by Cellular Automata -- 3 Main Results -- 4 Enumeration of Pairwise Balanced Bipermutive Rules -- 5 Conclusions -- References -- Filling Curves Constructed in Cellular Automata with Aperiodic Tiling -- 1 Introduction -- 2 Constructions and Fillings -- 2.1 Cellular Automata -- 2.2 Tile Set -- 3 Aperiodic Tile Set -- 3.1 From Tile Set Determinism to Cellular Automaton -- 3.2 A NW-Deterministic Aperiodic Tile Set -- 4 Aperiodic Filling -- 4.1 Linear Functions -- 4.2 Over-Logarithmic Growth Functions -- 5 Conclusions and Perspectives -- References -- Some Computational Limits of Trellis Automata -- 1 Introduction -- 2 Trellis Automaton -- 3 Factors Diagram for a Language -- 4 Trellis Automaton Patterns and Language Patterns -- 5 Counting Argument -- 6 Some Non Trellis Language -- 7 Conclusion -- References -- Turing-Completeness of Asynchronous Non-camouflage Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Asynchronous CA -- 2.2 Requirements -- 2.3 Priese System -- 3 Proposing Asynchronous Non-camouflage CA -- 3.1 Proposed CA M -- 3.2 Simulation of s-automaton -- 4 Discussion -- References -- Author Index. |
| Record Nr. | UNINA-9910484788203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Genetic Programming [[electronic resource] ] : 27th European Conference, EuroGP 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3–5, 2024, Proceedings / / edited by Mario Giacobini, Bing Xue, Luca Manzoni
| Genetic Programming [[electronic resource] ] : 27th European Conference, EuroGP 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3–5, 2024, Proceedings / / edited by Mario Giacobini, Bing Xue, Luca Manzoni |
| Autore | Giacobini Mario |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (236 pages) |
| Disciplina | 005.13 |
| Altri autori (Persone) |
XueBing
ManzoniLuca |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
System theory Computer networks Machine learning Natural language processing (Computer science) Programming Language Complex Systems Computer Communication Networks Machine Learning Natural Language Processing (NLP) |
| ISBN | 3-031-56957-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Long Presentations -- Fuzzy Pattern Trees for Classification Problems Using Genetic Programming -- Generational Computation Reduction in Informal Counterexample-Driven Genetic Programming -- Investigating Premature Convergence in Co-optimization of Morphology and Control in Evolved Virtual Soft Robots -- Grammar-based Evolution of Polyominoes -- Naturally Interpretable Control Policies via Graph-based Genetic Programming -- DALex: Lexicase-like Selection via Diverse Aggregation -- Enhancing Large Language Models-based Code Generation by Leveraging Genetic Improvement -- SLIM GSGP: The Non-Bloating Geometric Semantic Genetic Programming -- Improving Generalization of Evolutionary Feature Construction with Minimal Complexity Knee Points in Regression -- Short Presentations -- Look into the Mirror: Evolving Self-Dual Bent Boolean Functions.-An Algorithm Based on Grammatical Evolution for Discovering SHACL Constraints -- A Comprehensive Comparison of Lexicase-Based Selection Methods for Symbolic Regression Problems -- Improvement of Last Level Cache. |
| Record Nr. | UNISA-996589544603316 |
Giacobini Mario
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Genetic Programming [[electronic resource] ] : 27th European Conference, EuroGP 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3–5, 2024, Proceedings / / edited by Mario Giacobini, Bing Xue, Luca Manzoni
| Genetic Programming [[electronic resource] ] : 27th European Conference, EuroGP 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3–5, 2024, Proceedings / / edited by Mario Giacobini, Bing Xue, Luca Manzoni |
| Autore | Giacobini Mario |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (236 pages) |
| Disciplina | 005.13 |
| Altri autori (Persone) |
XueBing
ManzoniLuca |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
System theory Computer networks Machine learning Natural language processing (Computer science) Programming Language Complex Systems Computer Communication Networks Machine Learning Natural Language Processing (NLP) |
| ISBN | 3-031-56957-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Long Presentations -- Fuzzy Pattern Trees for Classification Problems Using Genetic Programming -- Generational Computation Reduction in Informal Counterexample-Driven Genetic Programming -- Investigating Premature Convergence in Co-optimization of Morphology and Control in Evolved Virtual Soft Robots -- Grammar-based Evolution of Polyominoes -- Naturally Interpretable Control Policies via Graph-based Genetic Programming -- DALex: Lexicase-like Selection via Diverse Aggregation -- Enhancing Large Language Models-based Code Generation by Leveraging Genetic Improvement -- SLIM GSGP: The Non-Bloating Geometric Semantic Genetic Programming -- Improving Generalization of Evolutionary Feature Construction with Minimal Complexity Knee Points in Regression -- Short Presentations -- Look into the Mirror: Evolving Self-Dual Bent Boolean Functions.-An Algorithm Based on Grammatical Evolution for Discovering SHACL Constraints -- A Comprehensive Comparison of Lexicase-Based Selection Methods for Symbolic Regression Problems -- Improvement of Last Level Cache. |
| Record Nr. | UNINA-9910847080303321 |
|
Giacobini Mario
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional Computation and Natural Computation [[electronic resource] ] : 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca
| Unconventional Computation and Natural Computation [[electronic resource] ] : 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 262 p. 68 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Computer simulation Bioinformatics Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Computer Modelling Computational and Systems Biology |
| ISBN | 3-642-39074-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Quantum, cellular, molecular, neural, DNA -- Membrane, and evolutionary computing -- Cellular automata -- Computation based on chaos and dynamical systems -- Massive parallel computation -- Collective intelligence -- Computation based on physical principles such as relativistic -- Optical, spatial, collision-based computing -- Amorphous computing -- Physarum computing -- Hypercomputation -- Fuzzy and rough computing -- Swarm intelligence -- Artificial immune systems -- Physics of computation -- Chemical computation -- Evolving hardware -- The computational nature of self-assembly, developmental processes, bacterial communication, and brain processes. |
| Record Nr. | UNISA-996465527403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation and Natural Computation [[electronic resource] ] : 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca
| Unconventional Computation and Natural Computation [[electronic resource] ] : 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 262 p. 68 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Computer simulation Bioinformatics Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Computer Modelling Computational and Systems Biology |
| ISBN | 3-642-39074-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Quantum, cellular, molecular, neural, DNA -- Membrane, and evolutionary computing -- Cellular automata -- Computation based on chaos and dynamical systems -- Massive parallel computation -- Collective intelligence -- Computation based on physical principles such as relativistic -- Optical, spatial, collision-based computing -- Amorphous computing -- Physarum computing -- Hypercomputation -- Fuzzy and rough computing -- Swarm intelligence -- Artificial immune systems -- Physics of computation -- Chemical computation -- Evolving hardware -- The computational nature of self-assembly, developmental processes, bacterial communication, and brain processes. |
| Record Nr. | UNINA-9910484482403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||