Cellular Automata: 9th International Conference on Cellular Automata for Research and Industry, ACRI 2010, Ascoli Piceno, Italy, September 21-24, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6350
Editat de Stefania Bandini, Sara Manzoni, Hiroshi Umeo, Giuseppe Vizzarien Limba Engleză Paperback – 20 sep 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 638.76 lei
Preț vechi: 798.45 lei
-20% Nou
Puncte Express: 958
Preț estimativ în valută:
113.05€ • 132.58$ • 99.12£
113.05€ • 132.58$ • 99.12£
Carte disponibilă
Livrare economică 06-20 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642159787
ISBN-10: 3642159788
Pagini: 672
Ilustrații: XVI, 672 p. 332 illus.
Greutate: 0.94 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642159788
Pagini: 672
Ilustrații: XVI, 672 p. 332 illus.
Greutate: 0.94 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Theoretical Results on Cellular Automata.- Information Transfer among Coupled Random Boolean Networks.- Open Environment for 2d Lattice-Grain CA.- All-to-All Communication with CA Agents by Active Coloring and Acknowledging.- The Sandpile Model: Parallelization of Efficient Algorithms for Systems with Shared Memory.- Theory and Application of Equal Length Cycle Cellular Automata (ELCCA) for Enzyme Classification.- Cellular Automata Model for Size Segregation of Particles.- Convex Hulls on Cellular Automata.- Square Kufic Pattern Formation by Asynchronous Cellular Automata.- Modeling and Simulation with Cellular Automata.- Development and Calibration of a Preliminary Cellular Automata Model for Snow Avalanches.- Tracking Uncertainty in a Spatially Explicit Susceptible-Infected Epidemic Model.- A Proximal Space Approach for Embedding Urban Geography into CA Models.- Bone Remodelling: A Complex Automata-Based Model Running in BioShape.- CANv2: A Hybrid CA Model by Micro and Macro-dynamics Examples.- Simulation of Traffic Flow at a Signalised Intersection.- A Novel Method for Simulating Cancer Growth.- Towards Cellular Automata Football Models with Mentality Accounting.- The Complexity of Three-Dimensional Critical Avalanches.- Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods.- Montebello: A Metapopulation Based Model of Carcinogenesis.- CA Dynamics, Control and Synchronization.- Towards Generalized Measures Grasping CA Dynamics.- Synchronization and Control of Cellular Automata.- Discovery by Genetic Algorithm of Cellular Automata Rules for Pattern Reconstruction Task.- Addition of Recurrent Configurations in Chip Firing Games: Finding Minimal Recurrent Configurations with Markov Chains.- A Seven-State Time-Optimum Square Synchronizer.- Codes andCryptography with Cellular Automata.- Null Boundary 90/150 Cellular Automata for Multi-byte Error Correcting Code.- Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata.- Chaotic Cellular Automata with Cryptographic Application.- d-Monomial Tests of Nonlinear Cellular Automata for Cryptographic Design.- Programmable Cellular Automata (PCA) Based Advanced Encryption Standard (AES) Hardware Architecture.- Exhaustive Evaluation of Radius 2 Toggle Rules for a Variable-Length Cryptographic Cellular Automata-Based Model.- Cellular Automata and Networks.- Network Decontamination with Temporal Immunity by Cellular Automata.- Characterization of CA Rules for SACA Targeting Detection of Faulty Nodes in WSN.- Cellular Automata Applied in Remote Sensing to Implement Contextual Pseudo-fuzzy Classification.- Impact of Coupling of Distributed Denial of Service Attack with Routing on Throughput of Packet Switching Network.- CA-Based Hardware.- A Cellular Automata-Based Modular Lighting System.- Modeling and Programming Asynchronous Automata Networks: The MOCA Approach.- Efficient Circuit Construction in Brownian Cellular Automata Based on a New Building-Block for Delay-Insensitive Circuits.- A Cellular Automaton Controlled Shading for a Building Facade.- FPGA Design of a Cellular Automaton Model for Railway Traffic Flow with GPS Module.- ACA - Int. Workshop on Asynchronous CA.- What Do We Mean by Asynchronous CA? A Reflection on Types and Effects of Asynchronicity.- Parallel Composition of Asynchronous Cellular Automata Simulating Reaction Diffusion Processes.- Comparative Study of Parallel Algorithms for Asynchronous Cellular Automata Simulation on Different Computer Architectures.- Coxeter Groups and Asynchronous Cellular Automata.- Some Formal Properties of Asynchronous Cellular Automata.- A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms.- C&CA - Int. Workshop on Crowds and CA.- Towards Patterns of Comfort: A Multilayered Model Based on Situated Multi-agent Systems.- A Pedestrian Movement Model That Takes into Account the Capacity Drop Phenomenon in the Motion of Crowd.- A Cellular Automaton Model for Crowd Evacuation and Its Auto-Defined Obstacle Avoidance Attribute.- A Learning Algorithm for the Simulation of Pedestrian Flow by Cellular Automata.- On Influencing of a Space Geometry on Dynamics of Some CA Pedestrian Movement Model.- The Dynamic Distance Potential Field in a Situation with Asymmetric Bottleneck Capacities.- Solving the Direction Field for Discrete Agent Motion.- Phase Coexistence in Congested States of Pedestrian Dynamics.- Stochastic Transition Model for Discrete Agent Movements.- Analysis of Obstacle Density Effect on Pedestrian Congestion Based on a One-Dimensional Cellular Automata.- Excluded Volume Effect in a Pedestrian Queue.- T&CA - Int. Workshop on Traffic and CA.- Simulation on Vehicle Emission by the Brake-Light Cellular Automata Model.- Bidirectional Traffic on Microtubules.- Cellular Automata for a Traffic Roundabout.- Cellular Automata for a Cyclic Bus.- Dynamics of a Tagged Particle in the Asymmetric Exclusion Process with Particlewise Disorder.- Chase and Escape in Groups.- A Velocity-Clearance Relation in the Rule-184 Cellular Automaton as a Model of Traffic Flow.- CA and MAS – With the NaSch as Example.- Productivity Enhancement through Lot Size Optimization.- Multilane Single GCA-w Based Expressway Traffic Model.- Properties of Cellular Automaton Model for On-ramp System.- Inversion of Flux between Zipper and Non-ZipperMerging in Highway Traffic.- Clustering and Transport Efficiency in Public Conveyance System.- Clusters in the Helbing’s Improved Model.- Phase Transitions in Cellular Automata for Cargo Transport and Kinetically Constrained Traffic.- A New Computational Methodology Using Infinite and Infinitesimal Numbers.- IWNC - Int. Workshop on Natural Computing.- Molecular Implementations of Cellular Automata.- Achieving Universal Computations on One-Dimensional Cellular Automata.