| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465612403316 |
|
|
Titolo |
Combinatorial Optimization and Applications [[electronic resource] ] : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings / / edited by T-H. Hubert Chan, Minming Li, Lusheng Wang |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2016.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XV, 793 p. 161 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 10043 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Numerical analysis |
Computer networks |
Computer graphics |
Discrete Mathematics in Computer Science |
Numerical Analysis |
Computer Communication Networks |
Computer Graphics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Graph Theory -- Geometric Optimization -- Complexity and Data Structure -- Combinatorial Optimization -- Miscellaneous. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016. The 60 full papers included in the book were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996210539203316 |
|
|
Titolo |
Combinatorial Optimization and Applications [[electronic resource] ] : 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings / / edited by Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2014.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XV, 774 p. 218 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8881 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Numerical analysis |
Computer networks |
Computer graphics |
Discrete Mathematics in Computer Science |
Numerical Analysis |
Computer Communication Networks |
Computer Graphics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling -- An Asymptotic Competitive Scheme for Online Bin Packing -- Randomized Online Algorithms for Set Cover Leasing Problems -- Optimizing Squares Covering a Set of Points -- Algorithms for Fair Partitioning of Convex Polygons -- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW -- On-Line Strategies for Evacuating from a Convex Region in the Plane -- Rectilinear Duals Using Monotone Staircase Polygons -- Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot -- Guarding Monotone Art Galleries with Sliding Cameras in Linear Time -- Information Gathering in Ad-Hoc Radio Networks with Tree Topology |
|
|
|
|
|
|
|
|
|
|
|
-- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network -- Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks -- Interference-Free k-barrier Coverage in Wireless Sensor Networks -- Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Space -- A Practical Greedy Approximation for the Directed Steiner Tree Problem -- Spanning Properties of Theta-Theta Graphs -- A Bicriteria Approximation Algorithm for DVRP with Time Windows -- Data-Oblivious Graph Algorithms in Outsourced External Memory -- A Dichotomy for Upper Domination in Monogenic Classes -- Algorithms for the Maximum Weight Connected k-Induced Subgraph Problem -- Algorithms for Cut Problems on Trees -- The Minimum Vulnerability Problem on Graphs -- The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs -- Two Paths Location of a Tree with Positive or Negative Weights -- Approximation Algorithms for Optimization Problems in Random Power-Law Graphs -- A Comparison Between the Zero Forcing Number and the Strong Metric Dimension of Graphs -- Optimal Trees for Minimizing Average Individual Updating Cost -- Cascading Critical Nodes Detection with Load Redistribution in Complex Systems -- The Power of Rejection in Online Bottleneck Matching -- The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs -- Integer Programming Methods for Special College Admissions Problems -- On the Width of Ordered Binary Decision Diagrams -- Tight Analysis of Priority Queuing for Egress Traffic -- Optimally Bracing Grid Frameworks with Holes -- Top-K Query Retrieval of Combinations with Sum-of-Subsets Ranking -- Efficient Group Testing Algorithms with a Constrained Number of Positive Responses -- Maximizing Revenues for On-Line Dial-a-Ride -- Global Internet Connectedness: 2002–2011 -- Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach -- Multivariate Heavy Tails in Complex Networks -- Mixed Degree-Degree Correlations in Directed Social Networks -- Social and Economic Network Formation: A Dynamic Model -- A Region Growing Algorithm for Detecting Critical Nodes -- A Fast Greedy Algorithm for the Critical Node Detection Problem -- Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs -- Complexity, Cryptography and Game -- On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints -- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications -- Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics -- Improved Even Order Magic Square Construction Algorithms and Their Applications -- The Complexity of the Positive Semidefinite Zero Forcing -- A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games -- The Popular Matching and Condensation Problems Under Matroid Constraints -- Incremental Computation of Pseudo-Inverse of Laplacian -- Optimal Tracking of Multiple Targets Using UAVs -- Approximation Algorithm for the Minimum Connected k-Path Vertex Cover Problem. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 8th International Conference on Combinatorial Optimization and Applications, COCOA 2014, held on the island of Maui, Hawaii, USA, in December 2014. The 56 full papers included in the book were carefully reviewed and selected from 133 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; optimization in graphs; applied optimization; CSoNet; and complexity, cryptography, and games. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNISA996466265403316 |
|
|
Titolo |
Formal Modeling and Analysis of Timed Systems [[electronic resource] ] : 10th International Conference, FORMATS 2012, London, UK, September 18-20, 2012, Proceedings / / edited by Marcin Jurdzinski, Dejan Nickovic |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2012.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 267 p. 71 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 7595 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Software engineering |
Compilers (Computer programs) |
Machine theory |
Computer programming |
Algorithms |
Computer Science Logic and Foundations of Programming |
Software Engineering |
Compilers and Interpreters |
Formal Languages and Automata Theory |
Programming Techniques |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and author index. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Talks -- Model-Driven Design-Space Exploration for Software-Intensive Embedded Systems (Extended Abstract) -- Statistical Model Checking, Refinement Checking, Optimization, for Stochastic Hybrid Systems.-Robustness of Time Petri Nets under Architectural Constraints -- Toward a Timed Theory of Channel Coding -- Playing Optimally on Timed Automata with Random Delays -- Dynamically-Driven Timed Automaton Abstractions for Proving Liveness of Continuous Systems -- Revisiting Timed Specification Theories: A Linear-Time Perspective -- Multi-core Reachability for Timed Automata -- Counterexample-Guided Synthesis of Observation Predicates -- |
|
|
|
|
|
|
|
|
|
|
|
Confidence Bounds for Statistical Model Checking of Probabilistic Hybrid Systems -- Region-Based Analysis of Hybrid Petri Nets with a Single General One-Shot Transition -- Reducing Quasi-Equal Clocks in Networks of Timed Automata -- SMT-Based Induction Methods for Timed Systems -- Timed Automata with Disjoint Activity -- The Complexity of Bounded Synthesis for Timed Control with Partial Observability -- Static Detection of Zeno Runs in UPPAAL Networks Based on Synchronization Matrices and Two Data-Variable Heuristics -- Frequencies in Forgetful Timed Automata -- Mcta: Heuristics and Search for Timed Systems. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 10th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2012, held in London, UK in September 2012. The 16 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 34 submissions. The book covers topics of foundations and semantics, methods and tools, techniques, algorithms, hybrid automata, appilcations, real-time software and hardware circuits. |
|
|
|
|
|
|
|
| |