Formal Modeling and Analysis of Timed Systems : 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008, Proceedings / / edited by Franck Cassez, Claude Jard |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (X, 295 p.) |
Disciplina | 004.33 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Computer science Software engineering Compilers (Computer programs) Programming Techniques Theory of Computation Software Engineering Computer Science Logic and Foundations of Programming Models of Computation Compilers and Interpreters |
ISBN | 3-540-85778-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Some Recent Results in Metric Temporal Logic -- Composing Web Services in an Open World: Issues of Quality of Service -- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets -- Session 1. Extensions of Timed Automata and Semantics -- Infinite Runs in Weighted Timed Automata with Energy Constraints -- Concavely-Priced Timed Automata -- Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets -- Timed Automata with Integer Resets: Language Inclusion and Expressiveness -- Session 2. Timed Games and Logic -- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities -- MTL with Bounded Variability: Decidability and Complexity -- Timed Parity Games: Complexity and Robustness -- On Scheduling Policies for Streams of Structured Jobs -- Session 3. Case Studies -- A Framework for Distributing Real-Time Functions -- Formal Modeling and Scheduling of Datapaths of Digital Document Printers -- Session 4. Model-Checking of Probabilistic Systems -- A Uniformization-Based Algorithm for Model Checking the CSL Until Operator on Labeled Queueing Networks -- Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains -- Session 5. Verification and Test -- Convergence Verification: From Shared Memory to Partially Synchronous Systems -- Compositional Abstraction in Real-Time Model Checking -- On Conformance Testing for Timed Systems -- Session 6. Time Petri Nets -- Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs -- Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph. |
Record Nr. | UNINA-9910484241503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Graph Drawing [[electronic resource] ] : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers / / edited by Walter Didimo, Maurizio Patrignani |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVI, 582 p. 231 illus.) |
Disciplina | 006.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer networks Computer science User interfaces (Computer systems) Human-computer interaction Discrete Mathematics in Computer Science Computer Communication Networks Models of Computation Symbolic and Algebraic Manipulation User Interfaces and Human Computer Interaction |
ISBN | 3-642-36763-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Flips -- Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and Simplification -- Counting Plane Graphs: Cross-Graph Charging -- Disconnectivity and Relative Positions in Simultaneous Embeddings -- Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage -- Graph Drawing by Classical Multidimensional Scaling: New Perspectives -- Progress on Partial Edge Drawings -- Implementing a Partitioned 2-Page Book Embedding Testing Algorithm -- Shrinking the Search Space for Clustered Planarity -- Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs -- The Approximate Rectangle of Influence Drawability Problem -- Planar Lombardi Drawings for Subcubic Graphs -- Circle-Representations of Simple 4-Regular Planar Graphs -- Smooth Orthogonal Layouts -- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants -- Planar Graphs as VPG-Graphs -- Proportional Contact Representations of 4-Connected Planar Graphs -- Edge-Weighted Contact Representations of Planar Graphs -- Column-Based Graph Layouts -- Upward Planarity Testing via SAT -- Self-approaching Graphs -- Homotopic C-Oriented Routing -- Covering Paths for Planar Point Sets -- On the Density of Maximal 1-Planar Graphs -- Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time -- Tangles and Degenerate Tangles -- The Visible Perimeter of an Arrangement of Disks -- Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings -- Planar Preprocessing for Spring Embedders -- StreamEB: Stream Edge Bundling -- Drawing Clustered Graphs as Topographic -- On The Usability of Lombardi Graph Drawings -- Drawing Metro Maps Using B´ezier Curves -- Mental Map Preservation Helps User Orientation in Dynamic Graphs -- Clustering, Visualizing, and Navigating for Large Dynamic Graphs -- DAGView: An Approach for Visualizing Large Graphs -- Time-Space Maps from Triangulations -- Graph Drawing in TikZ -- Optical Graph Recognition -- Interactive Random Graph Generation with Evolutionary Algorithms. |
Record Nr. | UNISA-996465673403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Graph Drawing : 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers / / edited by Walter Didimo, Maurizio Patrignani |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVI, 582 p. 231 illus.) |
Disciplina | 006.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer networks Computer science User interfaces (Computer systems) Human-computer interaction Discrete Mathematics in Computer Science Computer Communication Networks Models of Computation Symbolic and Algebraic Manipulation User Interfaces and Human Computer Interaction |
ISBN | 3-642-36763-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Flips -- Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and Simplification -- Counting Plane Graphs: Cross-Graph Charging -- Disconnectivity and Relative Positions in Simultaneous Embeddings -- Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage -- Graph Drawing by Classical Multidimensional Scaling: New Perspectives -- Progress on Partial Edge Drawings -- Implementing a Partitioned 2-Page Book Embedding Testing Algorithm -- Shrinking the Search Space for Clustered Planarity -- Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs -- The Approximate Rectangle of Influence Drawability Problem -- Planar Lombardi Drawings for Subcubic Graphs -- Circle-Representations of Simple 4-Regular Planar Graphs -- Smooth Orthogonal Layouts -- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants -- Planar Graphs as VPG-Graphs -- Proportional Contact Representations of 4-Connected Planar Graphs -- Edge-Weighted Contact Representations of Planar Graphs -- Column-Based Graph Layouts -- Upward Planarity Testing via SAT -- Self-approaching Graphs -- Homotopic C-Oriented Routing -- Covering Paths for Planar Point Sets -- On the Density of Maximal 1-Planar Graphs -- Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time -- Tangles and Degenerate Tangles -- The Visible Perimeter of an Arrangement of Disks -- Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings -- Planar Preprocessing for Spring Embedders -- StreamEB: Stream Edge Bundling -- Drawing Clustered Graphs as Topographic -- On The Usability of Lombardi Graph Drawings -- Drawing Metro Maps Using B´ezier Curves -- Mental Map Preservation Helps User Orientation in Dynamic Graphs -- Clustering, Visualizing, and Navigating for Large Dynamic Graphs -- DAGView: An Approach for Visualizing Large Graphs -- Time-Space Maps from Triangulations -- Graph Drawing in TikZ -- Optical Graph Recognition -- Interactive Random Graph Generation with Evolutionary Algorithms. |
Record Nr. | UNINA-9910739418603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Graph Drawing [[electronic resource] ] : 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Revised Selected Papers / / edited by Marc van Kreveld, Bettina Speckmann |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XIV, 458 p.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer science User interfaces (Computer systems) Human-computer interaction Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Models of Computation Symbolic and Algebraic Manipulation User Interfaces and Human Computer Interaction |
ISBN | 3-642-25878-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465991103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Graph Drawing [[electronic resource] ] : 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers / / edited by Ulrik Brandes, Sabine Cornelsen |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (XIV, 414 p. 202 illus., 91 illus. in color.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer science User interfaces (Computer systems) Human-computer interaction Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Models of Computation Symbolic and Algebraic Manipulation User Interfaces and Human Computer Interaction |
ISBN | 3-642-18469-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466027303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Graph Drawing [[electronic resource] ] : 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers / / edited by David Eppstein, Emden R Gansner |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (426 p. 199 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer science User interfaces (Computer systems) Human-computer interaction Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Models of Computation Symbolic and Algebraic Manipulation User Interfaces and Human Computer Interaction |
ISBN |
1-280-38569-3
9786613563613 3-642-11805-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Why Are String Graphs So Beautiful? -- The Art of Cheating When Drawing a Graph -- Papers -- Drawing Hamiltonian Cycles with No Large Angles -- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings -- On the Perspectives Opened by Right Angle Crossing Drawings -- Drawing 3-Polytopes with Good Vertex Resolution -- Planar Drawings of Higher-Genus Graphs -- Splitting Clusters to Get C-Planarity -- On the Characterization of Level Planar Trees by Minimal Patterns -- Characterization of Unlabeled Radial Level Planar Graphs -- Upward Planarization Layout -- More Flexible Radial Layout -- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations -- Port Constraints in Hierarchical Layout of Data Flow Diagrams -- Fast Edge-Routing for Large Graphs -- Leftist Canonical Ordering -- Succinct Greedy Drawings Do Not Always Exist -- Geometric Simultaneous Embeddings of a Graph and a Matching -- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs -- Removing Independently Even Crossings -- Manhattan-Geodesic Embedding of Planar Graphs -- Orthogonal Connector Routing -- On Rectilinear Drawing of Graphs -- Semi-bipartite Graph Visualization for Gene Ontology Networks -- On Open Problems in Biological Network Visualization -- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View -- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs -- Drawing Trees in a Streaming Model -- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree -- Drawing Planar 3-Trees with Given Face-Areas -- 3D Visibility Representations by Regular Polygons -- Complexity of Some Geometric and Topological Problems -- On Planar Supports for Hypergraphs -- DAGmaps and ?-Visibility Representations of DAGs -- Drawing Directed Graphs Clockwise -- An Improved Algorithm for the Metro-line Crossing Minimization Problem -- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection -- Posters -- GMap: Drawing Graphs as Maps -- Using High Dimensions to Compare Drawings of Graphs -- On ?-Constrained Upward Topological Book Embeddings -- 4-Labelings and Grid Embeddings of Plane Quadrangulations -- IBM ILOG Graph Layout for Eclipse -- Layout Techniques Coupled with Web2.0-Based Business Process Modeling -- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles -- Visualization of Complex BPEL Models -- DAGmaps and Dominance Relationships -- Scaffold Hunter – Interactive Exploration of Chemical Space -- Graph Drawing Contest -- Graph Drawing Contest Report. |
Record Nr. | UNISA-996465291703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Integration of Constraint Programming, Artificial Intelligence, and Operations Research [[electronic resource] ] : 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings / / edited by Louis-Martin Rousseau, Kostas Stergiou |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XX, 662 p. 389 illus., 91 illus. in color.) |
Disciplina | 005.11 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Numerical analysis
Artificial intelligence Algorithms Compilers (Computer programs) Computer science Numerical Analysis Artificial Intelligence Compilers and Interpreters Models of Computation |
ISBN | 3-030-19212-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Constraint Programming for Dynamic Symbolic Execution of JavaScript -- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms -- Core-Boosted Linear Search for Incomplete MaxSAT solving -- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation -- Local Rapid Learning for Integer Programs -- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming -- Generating Compound Moves in Local Search by Hybridisation with Complete Search -- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations -- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows -- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem -- Evaluating Ising Processing Units with Integer Programming -- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems -- A Counting-Based Approach to Scalable Micro-service Deployment -- An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service -- Consistency for 0-1 Programming -- Prediction + Optimization for the Knapsack Problem -- The maximum weighted submatrix coverage problem: A CP approach -- Learning MILP Resolution Outcomes Before Reaching Time-Limit -- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem -- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling -- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem -- Optimality Clue for Graph Coloring Problem -- Computing Wasserstein Barycenters via Linear Programming -- Repairing Learned Controllers with Convex Optimization: a Case Study -- A Hybrid Approach for Exact Coloring of Massive Graphs -- Modelling and Solving the Minimum Shift Design Problem -- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem -- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications -- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming -- Heat Exchanger Circuitry Design by Decision Diagrams -- A Column Generation for Online Ride-Sharing Services -- Some experiments with submodular function maximization via integer programming -- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation -- Last-Mile Scheduling Under Uncertainty -- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores -- Deep Inverse Optimization -- A Study on the Traveling Salesman Problem with a Drone -- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams -- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams -- Arc Consistency Revisited -- Embedding Decision Diagrams into Generative Adversarial Networks -- Time Table Edge Finding with Energy Variables -- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. |
Record Nr. | UNISA-996466327303316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings / / edited by Louis-Martin Rousseau, Kostas Stergiou |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XX, 662 p. 389 illus., 91 illus. in color.) |
Disciplina |
005.11
518 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Numerical analysis
Artificial intelligence Algorithms Compilers (Computer programs) Computer science Numerical Analysis Artificial Intelligence Compilers and Interpreters Models of Computation |
ISBN | 3-030-19212-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Constraint Programming for Dynamic Symbolic Execution of JavaScript -- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms -- Core-Boosted Linear Search for Incomplete MaxSAT solving -- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation -- Local Rapid Learning for Integer Programs -- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming -- Generating Compound Moves in Local Search by Hybridisation with Complete Search -- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations -- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows -- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem -- Evaluating Ising Processing Units with Integer Programming -- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems -- A Counting-Based Approach to Scalable Micro-service Deployment -- An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service -- Consistency for 0-1 Programming -- Prediction + Optimization for the Knapsack Problem -- The maximum weighted submatrix coverage problem: A CP approach -- Learning MILP Resolution Outcomes Before Reaching Time-Limit -- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem -- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling -- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem -- Optimality Clue for Graph Coloring Problem -- Computing Wasserstein Barycenters via Linear Programming -- Repairing Learned Controllers with Convex Optimization: a Case Study -- A Hybrid Approach for Exact Coloring of Massive Graphs -- Modelling and Solving the Minimum Shift Design Problem -- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem -- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications -- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming -- Heat Exchanger Circuitry Design by Decision Diagrams -- A Column Generation for Online Ride-Sharing Services -- Some experiments with submodular function maximization via integer programming -- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation -- Last-Mile Scheduling Under Uncertainty -- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores -- Deep Inverse Optimization -- A Study on the Traveling Salesman Problem with a Drone -- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams -- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams -- Arc Consistency Revisited -- Embedding Decision Diagrams into Generative Adversarial Networks -- Time Table Edge Finding with Energy Variables -- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. |
Record Nr. | UNINA-9910337851603321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
International Proceedings on Advances in Soft Computing, Intelligent Systems and Applications : ASISA 2016 / / edited by M. Sreenivasa Reddy, K. Viswanath, Shiva Prasad K.M |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XVII, 446 p. 205 illus.) |
Disciplina | 006.3 |
Collana | Advances in Intelligent Systems and Computing |
Soggetto topico |
Computational intelligence
Computer science Artificial intelligence—Data processing Computational Intelligence Models of Computation Data Science |
ISBN | 981-10-5272-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Preface -- Conference Organizing Committee -- About the Editors -- Table of Contents -- 39 Chapters -- Author Index. |
Record Nr. | UNINA-9910299576303321 |
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Introduction to Software Architecture [[electronic resource] ] : Innovative Design using Clean Architecture and Model-Driven Engineering / / by Kevin Lano, Sobhan Yassipour Tehrani |
Autore | Lano Kevin |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (264 pages) |
Disciplina | 005.12 |
Collana | Undergraduate Topics in Computer Science |
Soggetto topico |
Software engineering
Computer science Mobile computing Internet programming Software Engineering Models of Computation Mobile Computing Web Development |
ISBN | 3-031-44143-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction to Software Architecture Concepts -- Introduction to Clean Architecture Concepts,- Development Methods -- Compound Components and Complex Connectors -- Architectural Styles -- Mobile Application Architectures -- Enterprise Systems and Application Servers -- Web Application and Enterprise Information System Architectures -- Service-oriented Architectures -- Safety-critical and Embedded Systems Architectures -- Architectural Design for Machine Learning Systems -- Software Architectures and Re-engineering -- References -- Appendix A: User guide for the architecture diagram tool -- Appendix B: User guide for AgileUML -- Index. |
Record Nr. | UNISA-996558570803316 |
Lano Kevin
![]() |
||
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|