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.
Frontiers in Algorithmics [[electronic resource] ] : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings / / edited by Mingyu Xiao, Frances Rosamond
| Frontiers in Algorithmics [[electronic resource] ] : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings / / edited by Mingyu Xiao, Frances Rosamond |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 281 p. 50 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-319-59605-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Complexity of Minimizing the Total Calibration Cost -- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments -- On Computational Aspects of Greedy Partitioning of Graphs -- Maximum Edge Bicliques in Tree Convex Bipartite Graphs -- Complete Submodularity Characterization in the Comparative Independent Cascade Model -- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate -- Designing and Implementing Algorithms for the Closest String Problem -- The Broken-Triangle Property with Adjoint Values -- Online Knapsack Problem under Concave Functions -- Fluctuated Fitting under the L1-metric -- Optimal Partitioning Which Maximizes the Weighted Sum of Products -- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity -- Online Strategies for Evacuating from a Convex Region in the Plane -- A further analysis of the dynamic dominant resource fairness mechanism -- A 42k Kernel for the Complementary Maximal Strip Recovery Problem -- On-line Scheduling with a Monotonous Subsequence Constraint -- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling -- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters -- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order -- Geodectic Contraction Games on Trees -- On Approximation Algorithms for Two-Stage Scheduling Problems -- A New Lower Bound for Positive Zero Forcing -- Phase Transition for Maximum Not-All-Equal Satisfiability. . |
| Record Nr. | UNISA-996466275403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings / / edited by Mingyu Xiao, Frances Rosamond
| Frontiers in Algorithmics : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings / / edited by Mingyu Xiao, Frances Rosamond |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 281 p. 50 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Numerical analysis Artificial intelligence - Data processing Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-319-59605-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Complexity of Minimizing the Total Calibration Cost -- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments -- On Computational Aspects of Greedy Partitioning of Graphs -- Maximum Edge Bicliques in Tree Convex Bipartite Graphs -- Complete Submodularity Characterization in the Comparative Independent Cascade Model -- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate -- Designing and Implementing Algorithms for the Closest String Problem -- The Broken-Triangle Property with Adjoint Values -- Online Knapsack Problem under Concave Functions -- Fluctuated Fitting under the L1-metric -- Optimal Partitioning Which Maximizes the Weighted Sum of Products -- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity -- Online Strategies for Evacuating from a Convex Region in the Plane -- A further analysis of the dynamic dominant resource fairness mechanism -- A 42k Kernel for the Complementary Maximal Strip Recovery Problem -- On-line Scheduling with a Monotonous Subsequence Constraint -- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling -- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters -- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order -- Geodectic Contraction Games on Trees -- On Approximation Algorithms for Two-Stage Scheduling Problems -- A New Lower Bound for Positive Zero Forcing -- Phase Transition for Maximum Not-All-Equal Satisfiability. . |
| Record Nr. | UNINA-9910482979403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A guide to graph algorithms / / Ton Kloks and Mingyu Xiao
| A guide to graph algorithms / / Ton Kloks and Mingyu Xiao |
| Autore | Kloks Ton |
| Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (350 pages) |
| Disciplina | 518.1 |
| Soggetto topico |
Discrete mathematics
Graph algorithms Computer science - Mathematics |
| ISBN |
9789811663505
9789811663499 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996464534703316 |
Kloks Ton
|
||
| Gateway East, Singapore : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
A guide to graph algorithms / / Ton Kloks and Mingyu Xiao
| A guide to graph algorithms / / Ton Kloks and Mingyu Xiao |
| Autore | Kloks Ton |
| Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (350 pages) |
| Disciplina | 518.1 |
| Soggetto topico |
Discrete mathematics
Graph algorithms Computer science - Mathematics |
| ISBN |
981-16-6350-5
981-16-6349-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910743353503321 |
|
Kloks Ton
|
||
| Gateway East, Singapore : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A guide to graph algorithms / / Ton Kloks and Mingyu Xiao
| A guide to graph algorithms / / Ton Kloks and Mingyu Xiao |
| Autore | Kloks Ton |
| Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (350 pages) |
| Disciplina | 518.1 |
| Soggetto topico |
Discrete mathematics
Graph algorithms Computer science - Mathematics |
| ISBN |
981-16-6350-5
981-16-6349-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996549370503316 |
|
Kloks Ton
|
||
| Gateway East, Singapore : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science : 41st National Conference, NCTCS 2023, Guangzhou, China, July 21–23, 2023, Revised Selected Papers / / edited by Zhiping Cai, Mingyu Xiao, Jialin Zhang
| Theoretical Computer Science : 41st National Conference, NCTCS 2023, Guangzhou, China, July 21–23, 2023, Revised Selected Papers / / edited by Zhiping Cai, Mingyu Xiao, Jialin Zhang |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (272 pages) |
| Disciplina | 004 |
| Collana | Communications in Computer and Information Science |
| Soggetto topico |
Computer science
Database management Computer systems Computer networks Theory of Computation Database Management Computer System Implementation Computer Communication Networks Theory and Algorithms for Application Domains |
| ISBN | 981-9977-43-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computational Theory and Model -- Nonmonotone submodular maximization under routing constraints -- A formal approach for traceability preservation in software development process -- Generalized Properties of Generalized Fuzzy sets GFScom and Its Application -- A Novel Method for Signal Sequence Classification based on Markov Reward Models -- Approximation Algorithms -- An Optimal Algorithm based on Fairness of Resource Allocation in Wireless Mesh Networks -- An Approximation Algorithm for Stochastic Power Cover Problem -- ϵ-Approximate Bisimulations for Nondeterministic Fuzzy Kripke structures -- Scheduling with hierarchies and overload cost -- Artificial Intelligence -- Region-SMOTE: A New Over-Sampling Method in Imbalanced Data Sets Learn-ing -- Intelligent Decision Making for Tanker Air Control Conflict Deployment -- Efficient Recommendation Algorithm for Employment of College Students for Various Majors -- Coordinated Reconstruction Dual-Branch Network for Low-dose PET Reconstruction -- Network and Security -- Link prediction in dynamic networks based on topological and historical information -- Link prediction in multiplex network based on regression and conditional probability -- A Zero Trust Model for Networked Self-Service Terminals -- Modeling and Verification of WPA3 Security Protocol Based on SPIN. |
| Record Nr. | UNINA-9910768162403321 |
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||