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.
Combinatorial Optimization and Applications [[electronic resource] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Jianxiong Guo
| Combinatorial Optimization and Applications [[electronic resource] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Jianxiong Guo |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (505 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | GuoJianxiong |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Artificial intelligence Computer science - Mathematics Data structures (Computer science) Information theory Computer graphics Theory of Computation Artificial Intelligence Mathematics of Computing Data Structures and Information Theory Computer Graphics |
| ISBN | 3-031-49614-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling and Algorithms -- Differentiable Discrete Optimization using Dataless Neural Networks -- When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model -- Twin-treewidth: A single-exponential logic-based approach -- Highway Preferential Attachment Models for Geographic Routing -- Complexity and Approximation -- Restricted Holant Dichotomy on Domains 3 and 4 -- Earliest Deadline First is a $2$-approximation for DARP with Time Windows -- Improved approximation for broadcasting in k-Path Graphs -- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) -- Combinatorics and Computing -- Strong edge coloring of subquartic graphs -- Two multicolor Ramsey numbers involving bipartite graphs -- Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets -- Computing random r-orthogonal Latin squares -- Optimization and Algorithms -- A Two-stage Seeds Algorithm for Competitive Influence Maximization considering User Demand -- Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems -- Testing Higher-order Clusterability on graphs -- The $2$-mixed-center color spanning problem -- A Dynamic Parameter Adaptive Path Planning Algorithm -- On the Mating Between a Polygonal Curve and a Convex Polygon -- A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion -- Multi-Winner Approval Voting with Grouped Voters -- EFX Allocation to Chores Over Small Graph -- Extreme Graph and Others -- Zero-visibility Cops and Robber game on Cage graph -- Online Facility Assignment for General Layout of Servers on a Line -- Guarding Precise and Imprecise Polyhedral Terrains with Segments -- The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition -- On Problems Related to Absent Subsequences -- Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs -- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints -- Critical $(P_5,dart)$-Free Graphs -- Graph Clustering through Users' Properties and Social Influence -- Machine Learning, Blockchain and Others -- Incorporating Neural Point Process-based Temporal Feature for Rumor Detection -- Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms -- Information Theory of Blockchain Systems -- Machine Learning with Low Resource Data from Psychiatric Clinics -- Single Image Dehazing Based on Dynamic Convolution and Transformer -- Reinforcement Learning for Combating Cyberbullying in Online Social Networks. |
| Record Nr. | UNINA-9910770253503321 |
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Jianxiong Guo
| Combinatorial Optimization and Applications [[electronic resource] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Jianxiong Guo |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (535 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | GuoJianxiong |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Computer graphics Theory of Computation Data Structures and Information Theory Mathematics of Computing Artificial Intelligence Computer Graphics |
| ISBN | 3-031-49611-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Optimization in Graphs -- An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs -- Algorithms on a path covering problem with applications in transportation -- Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges -- An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line -- Online Dominating Set and Coloring -- Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on graphs having small dominating sets -- Exactly k MSTs: How many vertices suffice? -- Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs -- Scheduling -- Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints -- Two Exact Algorithms for the Packet Scheduling Problem -- Improved Scheduling with a Shared Resource -- An Energy-efficient Scheduling Method for Real-time Multi-workflow in Container Cloud -- Set-Related Optimization -- Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces -- The MaxIS-Shapley Value in Perfect Graphs -- Asteroidal Sets and Dominating Paths -- A Novel Approximation Algorithm for Max-Covering Circle Problem -- GAMA: Genetic algorithm for k-coverage and connectivity with minimum sensor activation in wireless sensor networks -- Simple Heuristics for the Rooted Max Tree Coverage Problem -- Efficient Algorithms for k-Submodular Maximization with the p-system and d-knapsack Constraints -- Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization -- Greedy+Max: An Efficient Approximation Algorithm for $k$-Submodular Knapsack Maximization -- Applied Optimization and Algorithm -- Improved Lower Bound for Estimating the Number of Defective Items -- Popularity on the Roommate Diversity Problem -- On Half Guarding Polygons -- Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem -- Algorithms for the Ridesharing with Profit Constraint Problem -- Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms -- Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs -- The Line-constrained Maximum Coverage Facility Location Problem -- Graph Planer and Others -- On Connectedness of Solutions to Integer Linear Systems -- An exact algorithm for the line-constrained bottleneck $k$-Steiner tree problem -- The Longest Subsequence-Repeated Subsequence Problem -- An Approximation Algorithm for Covering Vertices by 4^+-Paths -- V-Words, Lyndon Words and Substring circ-UMFFs -- The Two-Center Problem of Uncertain Points on Trees -- Space-Time Graph Planner for Unsignalized Intersections with CAVs -- The Two Sheriffs Problem: Cryptographic Formalization and Generalization. |
| Record Nr. | UNINA-9910770270403321 |
|
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Guangmo Tong
| Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Guangmo Tong |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (430 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | TongGuangmo |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN | 3-031-49193-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity and Approximation -- Complexity and Enumeration in Models of Genome Rearrangement -- Conditional automatic complexity and its metrics -- Streaming and Query Once Space Complexity of Longest Increasing Subsequence -- Approximating Decision Trees with Priority Hypotheses -- Approximating the $\lambda$-low-density Value -- Exponential Time Complexity of the Complex Weighted Boolean \#CSP -- Hardness and approximation for the star $p$-hub routing cost problem in $\Delta_\beta$-metric graphs -- Graph Algorithms -- Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs -- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width -- Shortest Longest-Path Graph Orientations -- Sink Location Problems in Dynamic Flow Grid Networks -- List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs -- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs -- Sum-of-Local-Effects Data Structures for Separable Graphs -- Applied Algorithms -- Variants of Euclidean k-center Clusterings -- Red-black Spanners for Mixed-charging Vehicular Networks -- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds via Locally-iterative Algorithms -- On Detecting Some Defective Items in Group Testing -- An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression -- Multi-Load Agent Path Finding for Online Pickup and Delivery Problem -- Improved Sourcewise Roundtrip Spanners with Constant Stretch -- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy Preservation -- The k edge-vertex domination problem -- Resource-Adaptive Newton’s Method for Distributed Learning -- DR-submodular Function Maximization with Adaptive Stepsize -- On the Routing Problems in Graphs with Ordered Forbidden Transitions -- Delaying Decisions and Reservation Costs -- A PTAS Framework for Clustering Problems in Doubling Metrics -- A Physical Zero-knowledge Proof for Sumplete, a Puzzle Generated by Chat GPT. |
| Record Nr. | UNINA-9910770245903321 |
|
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Guangmo Tong
| Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Guangmo Tong |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | TongGuangmo |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN | 3-031-49190-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorics and Algorithms -- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher -- Extended formulations via decision diagrams -- Greedy Gray codes for Dyck words and ballot sequences -- Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication -- (min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences -- A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons -- An Approach to Agent Path Planning under Temporal Logic Constraints -- The Heterogeneous Rooted Tree Cover Problem -- The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model -- The Regularized Submodular Maximization via the Lyapunov Method -- Topological network-control games -- Lower Bounds of Functions on Finite Abelian Groups -- A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering -- Random Shortening of Linear Codes and Applications -- Algorithms for Full-View Coverage of Targets with Group Set Cover -- Improved bounds for the binary paint shop problem -- Algorithmic Solution in Applications -- Fitch Graph Completion -- Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays -- Diversity and freshness-aware regret minimizing set queries -- A Modified EXP3 in Adversarial Bandits with Multi-User Delayed Feedback -- Cabbage Can’t Always be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals -- k-median/means with outliers revisited: a simple fpt approximation -- A cost-sharing scheme for the $k$-product facility location game with penalties -- Algorithm in Networks -- Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks -- Stochastic Model for Rumor Blocking Problem in Social Networks under Rumor Source Uncertainty -- Algorithms for Shortest Path Tour Problem in Large-Scale Road Network -- Solving systems of linear equations through zero forcing sets -- Profit Maximization for Competitive Influence Spread in Social Networks -- Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing -- On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes -- Approval-Based Participatory Budgeting with Donations. |
| Record Nr. | UNINA-9910770254303321 |
|
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Guangmo Tong
| Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Guangmo Tong |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | TongGuangmo |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN | 3-031-49190-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorics and Algorithms -- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher -- Extended formulations via decision diagrams -- Greedy Gray codes for Dyck words and ballot sequences -- Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication -- (min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences -- A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons -- An Approach to Agent Path Planning under Temporal Logic Constraints -- The Heterogeneous Rooted Tree Cover Problem -- The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model -- The Regularized Submodular Maximization via the Lyapunov Method -- Topological network-control games -- Lower Bounds of Functions on Finite Abelian Groups -- A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering -- Random Shortening of Linear Codes and Applications -- Algorithms for Full-View Coverage of Targets with Group Set Cover -- Improved bounds for the binary paint shop problem -- Algorithmic Solution in Applications -- Fitch Graph Completion -- Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays -- Diversity and freshness-aware regret minimizing set queries -- A Modified EXP3 in Adversarial Bandits with Multi-User Delayed Feedback -- Cabbage Can’t Always be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals -- k-median/means with outliers revisited: a simple fpt approximation -- A cost-sharing scheme for the $k$-product facility location game with penalties -- Algorithm in Networks -- Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks -- Stochastic Model for Rumor Blocking Problem in Social Networks under Rumor Source Uncertainty -- Algorithms for Shortest Path Tour Problem in Large-Scale Road Network -- Solving systems of linear equations through zero forcing sets -- Profit Maximization for Competitive Influence Spread in Social Networks -- Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing -- On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes -- Approval-Based Participatory Budgeting with Donations. |
| Record Nr. | UNISA-996587869603316 |
|
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Guangmo Tong
| Computing and Combinatorics [[electronic resource] ] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Guangmo Tong |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (430 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | TongGuangmo |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN | 3-031-49193-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity and Approximation -- Complexity and Enumeration in Models of Genome Rearrangement -- Conditional automatic complexity and its metrics -- Streaming and Query Once Space Complexity of Longest Increasing Subsequence -- Approximating Decision Trees with Priority Hypotheses -- Approximating the $\lambda$-low-density Value -- Exponential Time Complexity of the Complex Weighted Boolean \#CSP -- Hardness and approximation for the star $p$-hub routing cost problem in $\Delta_\beta$-metric graphs -- Graph Algorithms -- Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs -- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width -- Shortest Longest-Path Graph Orientations -- Sink Location Problems in Dynamic Flow Grid Networks -- List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs -- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs -- Sum-of-Local-Effects Data Structures for Separable Graphs -- Applied Algorithms -- Variants of Euclidean k-center Clusterings -- Red-black Spanners for Mixed-charging Vehicular Networks -- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds via Locally-iterative Algorithms -- On Detecting Some Defective Items in Group Testing -- An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression -- Multi-Load Agent Path Finding for Online Pickup and Delivery Problem -- Improved Sourcewise Roundtrip Spanners with Constant Stretch -- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy Preservation -- The k edge-vertex domination problem -- Resource-Adaptive Newton’s Method for Distributed Learning -- DR-submodular Function Maximization with Adaptive Stepsize -- On the Routing Problems in Graphs with Ordered Forbidden Transitions -- Delaying Decisions and Reservation Costs -- A PTAS Framework for Clustering Problems in Doubling Metrics -- A Physical Zero-knowledge Proof for Sumplete, a Puzzle Generated by Chat GPT. |
| Record Nr. | UNISA-996587869703316 |
|
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Optimal coverage in wireless sensor networks / / Weili Wu [and three others]
| Optimal coverage in wireless sensor networks / / Weili Wu [and three others] |
| Autore | Wu Weili |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XII, 297 p. 118 illus., 39 illus. in color.) |
| Disciplina | 681.2 |
| Collana | Springer optimization and its applications |
| Soggetto topico | Wireless sensor networks |
| ISBN | 3-030-52824-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- 1. Introduction -- 2. Sensor Cover -- 3. Connected Sensor Cover -- 4. lifetime of Coverage -- 5. Weighted Sensor Cover -- 6. k-Coverage -- 7. Heterogeneous Sensors -- 8. Barrier Coverage -- 9. Sweep-Coverage -- 10. Partial Coverage -- 11. Mobile Sensors -- 12. Camera Sensors -- Energy-Harvesting Sensors -- Underwater Sensor -- Crowdsensing -- Bibliography. |
| Record Nr. | UNINA-9910484087103321 |
|
Wu Weili
|
||
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Optimal coverage in wireless sensor networks / / Weili Wu [and three others]
| Optimal coverage in wireless sensor networks / / Weili Wu [and three others] |
| Autore | Wu Weili |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XII, 297 p. 118 illus., 39 illus. in color.) |
| Disciplina | 681.2 |
| Collana | Springer optimization and its applications |
| Soggetto topico | Wireless sensor networks |
| ISBN | 3-030-52824-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- 1. Introduction -- 2. Sensor Cover -- 3. Connected Sensor Cover -- 4. lifetime of Coverage -- 5. Weighted Sensor Cover -- 6. k-Coverage -- 7. Heterogeneous Sensors -- 8. Barrier Coverage -- 9. Sweep-Coverage -- 10. Partial Coverage -- 11. Mobile Sensors -- 12. Camera Sensors -- Energy-Harvesting Sensors -- Underwater Sensor -- Crowdsensing -- Bibliography. |
| Record Nr. | UNISA-996418202803316 |
|
Wu Weili
|
||
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||