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.
Algorithms for sensor systems : 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9-10, 2020, revised selected papers / / Cristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi (Eds.)
| Algorithms for sensor systems : 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9-10, 2020, revised selected papers / / Cristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi (Eds.) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (IX, 187 p. 72 illus., 32 illus. in color.) |
| Disciplina | 518.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Artificial intelligence Computer organization |
| ISBN | 3-030-62401-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimizing Total Interference in Asymmetric Sensor Networks -- Distributed Localization of Wireless Sensor Network Using Communication Wheel -- Covering users by a connected swarm efficiently -- VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints -- Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots -- On Efficient Connectivity-Preserving Transformations in a Grid -- Live Exploration with Mobile Robots in a Dynamic Ring, Revisited -- Asynchronous Filling by Myopic Luminous Robots -- Weighted Group Search on a Line -- Fast Byzantine Gathering with Visibility in Graphs -- Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots -- Conic Formation in Presence of Faulty Robots. |
| Record Nr. | UNINA-9910427678003321 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms for sensor systems : 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9-10, 2020, revised selected papers / / Cristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi (Eds.)
| Algorithms for sensor systems : 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9-10, 2020, revised selected papers / / Cristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi (Eds.) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (IX, 187 p. 72 illus., 32 illus. in color.) |
| Disciplina | 518.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Artificial intelligence Computer organization |
| ISBN | 3-030-62401-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimizing Total Interference in Asymmetric Sensor Networks -- Distributed Localization of Wireless Sensor Network Using Communication Wheel -- Covering users by a connected swarm efficiently -- VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints -- Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots -- On Efficient Connectivity-Preserving Transformations in a Grid -- Live Exploration with Mobile Robots in a Dynamic Ring, Revisited -- Asynchronous Filling by Myopic Luminous Robots -- Weighted Group Search on a Line -- Fast Byzantine Gathering with Visibility in Graphs -- Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots -- Conic Formation in Presence of Faulty Robots. |
| Record Nr. | UNISA-996418312903316 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algoritmi fondamentali / R. Geoff Dromey
| Algoritmi fondamentali / R. Geoff Dromey |
| Autore | Dromey, Geoff R. |
| Pubbl/distr/stampa | Milano, : Jackson, 1997 |
| Descrizione fisica | XV, 436 p. ; 24 cm |
| Disciplina | 518.1(Algoritmi) |
| Soggetto topico | 68-XX - Computer science [MSC 2020] |
| ISBN |
88-7056-736-2
978-88-7056-736-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNICAMPANIA-VAN0016415 |
Dromey, Geoff R.
|
||
| Milano, : Jackson, 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Algoritmi fondamentali / R. Geoff Dromey
| Algoritmi fondamentali / R. Geoff Dromey |
| Autore | Dromey, Geoff R. |
| Edizione | [Milano : Jackson, 1997] |
| Descrizione fisica | Tit. orig.: How to solve it by computer. |
| Disciplina | 518.1(Algoritmi) |
| Soggetto topico | 68-XX - Computer science [MSC 2020] |
| ISBN |
88-7056-736-2
978-88-7056-736-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNICAMPANIA-SUN0016415 |
|
Dromey, Geoff R.
|
||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Alocações, estabilidade e otimização : uma introdução passo a passo / / Aline Guarnieri Gubitoso, Vinicius Cifú Lopes
| Alocações, estabilidade e otimização : uma introdução passo a passo / / Aline Guarnieri Gubitoso, Vinicius Cifú Lopes |
| Autore | Gubitoso Aline Guarnieri |
| Pubbl/distr/stampa | SciELO Books - Editora UFABC, 2017 |
| Descrizione fisica | 1 online resource (142 pages) |
| Disciplina | 518.1 |
| Soggetto topico |
Algorithms
Assignment problems (Programming) Computer algorithms |
| ISBN | 85-68576-82-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | por |
| Record Nr. | UNINA-9910409838003321 |
|
Gubitoso Aline Guarnieri
|
||
| SciELO Books - Editora UFABC, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applications of flower pollination algorithm and its variants / / editor, Nilanjan Dey
| Applications of flower pollination algorithm and its variants / / editor, Nilanjan Dey |
| Pubbl/distr/stampa | Singapore : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (247 pages) : illustrations |
| Disciplina | 518.1 |
| Collana | Springer Tracts in Nature-Inspired Computing |
| Soggetto topico |
Algorithms
Swarm intelligence Computational intelligence Algorismes computacionals Intel·ligència computacional |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 981-336-104-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Contents -- Editor and Contributors -- 1 Flower Pollination Algorithm: Basic Concepts, Variants, and Applications -- 1 Introduction -- 2 Biological Inspirations: Pollination of Flowering Plants -- 3 Flower Pollination Optimization Algorithm (FPA) -- 3.1 Global Search in FPA: Biotic Pollination Process -- 3.2 Local Search in FPA: Abiotic Pollination Process -- 3.3 Switch Probability in FPA -- 3.4 Parametric Study for FPA -- 3.5 Implementation of FPA -- 3.6 Advantages of FPA -- 4 Variants of FPA -- 4.1 Multi-objective Flower Pollination Algorithm (MOFPA) -- 4.2 Modified Flower Pollination Algorithms (M-FPA) -- 4.3 Hybridized Variants of FPA -- 5 Applications of FPA and Its Variants -- 6 Comparative Analytical Studies of FPA and its Variants -- 7 Limitations of FPA -- 8 Challenging Problems in FPA -- 9 Conclusions -- References -- 2 Optimization of Non-rigid Demons Registration Using Flower Pollination Algorithm -- 1 Introduction -- 2 Methodology -- 2.1 Demons Registration -- 2.2 Flower Pollination Algorithm -- 3 Proposed Method -- 4 Results and Discussion -- 5 Conclusion -- References -- 3 Adaptive Neighbor Heuristics Flower Pollination Algorithm Strategy for Sequence Test Generation -- 1 Introduction -- 2 T-way Tests Generation Problem -- 2.1 T-way Tests Generation -- 2.2 Sequence t-way Tests Generation -- 3 Related Works -- 4 Adaptive Neighbor Heuristics Flower Pollination Algorithm Strategy -- 5 Experimental Results -- 5.1 Benchmarking with Existing Strategies -- 5.2 Convergence Rate Analysis -- 6 Summary -- References -- 4 Implementation of Flower Pollination Algorithm to the Design Optimization of Planar Antennas -- 1 Introduction -- 2 Flower Pollination Algorithm -- 2.1 Pollination Phenomenon -- 2.2 Modeling of Flower Pollination Algorithm -- 3 The Cooperating Platform for Simulation and Optimization of the Antenna Designs.
3.1 The Cooperating Platform -- 3.2 S-parameters -- 3.3 Cooperation of FPA and the Simulator -- 4 The Optimized Designs of Planar Antennas -- 4.1 UWB Antenna Design -- 4.2 Dual BN Characteristic Optimization of the UWB Antenna -- 4.3 Single UWB Antenna Element for a Quad-Element MIMO Antenna -- 4.4 Quad-Element MIMO Antenna -- 5 Conclusions -- References -- 5 Flower Pollination Algorithm for Slope Stability Analysis -- 1 Introduction -- 2 Problem Statement -- 2.1 Generation of Trial Slip Surface -- 2.2 Calculation of Factor of Safety -- 2.3 Application of Optimization Method -- 3 Flower Pollination Algorithm -- 4 Numerical Analysis -- 4.1 Sensitivity Analysis -- 4.2 Case-1 -- 4.3 Case-2 -- 4.4 Case-3 -- 5 Discussion and Conclusions -- References -- 6 Optimum Sizing of Truss Structures Using a Hybrid Flower Pollinations -- 1 Introduction -- 2 Sizing Optimization Problem -- 3 Optimization Algorithms -- 3.1 Flower Pollination Algorithm -- 3.2 Differential Evolution -- 3.3 Hybrid Flower Pollination-Differential Evolution -- 4 Numerical Experiments and Results -- 5 10-Bar Planar Truss -- 5.1 17-Bar Planar Truss -- 5.2 45-Bar Planar Truss -- 6 Conclusion -- References -- 7 Optimizing Reinforced Cantilever Retaining Walls Under Dynamic Loading Using Improved Flower Pollination Algorithm -- 1 Introduction -- 2 Design Steps of Reinforced Retaining Walls -- 2.1 Geometrical Design Variables -- 2.2 Geotechnical Stability of Reinforced Cantilever Retaining Walls -- 2.3 Structural Constraints for Reinforced Cantilever Retaining Walls -- 3 Optimum Design of Reinforced Concrete Cantilever Retaining Walls -- 3.1 Objective Function -- 4 Optimization Algorithms -- 4.1 Flower Pollination Algorithm -- 4.2 Improved Flower Pollination Algorithm -- 5 Numerical Experiments -- 5.1 Example 1 -- 5.2 Example 2 -- 6 Conclusions -- References. 8 Multi-objective Flower Pollination Algorithm and Its Variants to Find Optimal Golomb Rulers for WDM Systems -- 1 Introduction -- 2 Optimal Golomb Rulers (OGRs) -- 3 Multi-objective Flower Pollination Algorithm and Its Variants -- 3.1 Multi-objective Flower Pollination Algorithm -- 3.2 Variants of Multi-objective Flower Pollination Algorithm -- 4 Problem Formulation -- 5 Results and Discussion -- 5.1 Comparative Study of Flower Pollination-Inspired MOAs in Terms of the Ruler Length and Total Occupied Unequally Spaced Optical Channel Bandwidth -- 5.2 Comparative Study of Flower Pollination-Inspired MOAs in Terms of BEF -- 5.3 Comparative Study of Flower Pollination-Inspired MOAs in Terms of Computational CPU Time -- 5.4 Maximum Computation Complexity of Flower Pollination-Inspired MOAs in Terms of Big O Notation -- 5.5 Wilcoxon Rank-Sum Test of Flower Pollination-Inspired MOAs -- 6 Conclusions -- References -- 9 Applications of Flower Pollination Algorithm in Wireless Sensor Networking and Image Processing: A Detailed Study -- 1 Introduction -- 2 Swarm Intelligence Algorithm -- 2.1 Bat Algorithm -- 2.2 Firefly Algorithm -- 2.3 Particle Swarm Optimization -- 2.4 Artificial Bee Colony Algorithm -- 2.5 Cuckoo Search Algorithm -- 3 Flower Pollination Algorithm -- 3.1 Flower Pollination -- 3.2 The Flower Pollination Algorithm (FPA) -- 3.3 Variants of Flower Pollination Algorithm (FPA) -- 4 Wireless Sensor Networks -- 4.1 Impact of Flower Pollination Algorithm in Wireless Sensor Networking -- 5 Image Processing -- 5.1 Impact of Flower Pollination Algorithm in Image Processing -- 6 Discussion -- 7 Conclusion -- References -- 10 Flower Pollination Algorithm Tuned PID Controller for Multi-source Interconnected Multi-area Power System -- 1 Introduction -- 2 Power System Investigation -- 2.1 Proportional Integral Derivative (PID) Controller. 3 Flower Pollination Algorithm Tuned PID Controller -- 4 Result Analysis and Discussions -- 5 Conclusions -- References. |
| Record Nr. | UNINA-9910767581903321 |
| Singapore : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applied Probability Theory : New Perspectives, Recent Advances and Trends / / edited by Abdo Abou Jaoude
| Applied Probability Theory : New Perspectives, Recent Advances and Trends / / edited by Abdo Abou Jaoude |
| Pubbl/distr/stampa | London : , : IntechOpen, , 2023 |
| Descrizione fisica | 1 online resource (ix, 172 pages) : illustrations |
| Disciplina | 518.1 |
| Soggetto topico | Algorithms |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Chapter 1 The Paradigm of Complex Probability and Quantum Mechanics: The Infinite Potential Well Problem - The Position Wave Function by Abdo Abou Jaoudé -- Chapter 2 The Paradigm of Complex Probability and Quantum Mechanics: The Infinite Potential Well Problem - The Momentum Wavefunction and the Wavefunction Entropies by Abdo Abou Jaoudé -- Chapter 3 Stability of Algorithms in Statistical Modeling by Alexander A. Kronberg and Tatiana K. Kronberg -- Chapter 4 Some Results on the Non-Homogeneous Hofmann Process by Gerson Yahir Palomino Velandia and José Alfredo Jiménez Moscoso -- Chapter 5 Probability to Be Involved in a Road Accident: Transport User Socioeconomic Approach by Saúl Antonio Obregón Biosca, José Luis Reyes Araiza and Miguel Angel Pérez Lara y Hernández -- Chapter 6 Quantifying Risk Using Loss Distributions by Retsebile Maphalla, Moroke Mokhoabane, Mulalo Ndou and Sandile Shongw. |
| Altri titoli varianti | Applied Probability Theory |
| Record Nr. | UNINA-9910647204703321 |
| London : , : IntechOpen, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors
| Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors |
| Edizione | [First edition.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (XII, 236 p. 35 illus., 13 illus. in color.) |
| Disciplina | 518.1 |
| Collana | Lecture Notes in Computer Science Series |
| Soggetto topico |
Online algorithms
Approximation algorithms |
| ISBN | 3-031-49815-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Optimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization. |
| Record Nr. | UNISA-996574257903316 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors
| Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors |
| Edizione | [First edition.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (XII, 236 p. 35 illus., 13 illus. in color.) |
| Disciplina | 518.1 |
| Collana | Lecture Notes in Computer Science Series |
| Soggetto topico |
Online algorithms
Approximation algorithms |
| ISBN | 3-031-49815-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Optimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization. |
| Record Nr. | UNINA-9910799485803321 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Artificial Intelligence and Soft Computing [[electronic resource] ] : 21st International Conference, ICAISC 2022, Zakopane, Poland, June 19–23, 2022, Proceedings, Part II / / edited by Leszek Rutkowski, Rafał Scherer, Marcin Korytkowski, Witold Pedrycz, Ryszard Tadeusiewicz, Jacek M. Zurada
| Artificial Intelligence and Soft Computing [[electronic resource] ] : 21st International Conference, ICAISC 2022, Zakopane, Poland, June 19–23, 2022, Proceedings, Part II / / edited by Leszek Rutkowski, Rafał Scherer, Marcin Korytkowski, Witold Pedrycz, Ryszard Tadeusiewicz, Jacek M. Zurada |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (414 pages) |
| Disciplina | 518.1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer science—Mathematics Algorithms Computer networks Data mining Education—Data processing Artificial Intelligence Mathematics of Computing Design and Analysis of Algorithms Computer Communication Networks Data Mining and Knowledge Discovery Computers and Education |
| ISBN | 3-031-23480-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computer Vision, Image and Speech Analysis -- Unsupervised Pose Estimation by means of an innovative Vision Transformer -- CamCarv - Expose the source Camera at the rear of seam insertion -- Text Line Segmentation in Historical Newspapers -- Stacked ensemble of convolutional neural networks for follicles detection on scalp images -- RGB-D SLAM with Deep Depth Completion -- Semantically consistent sim-to-real image translation with neural networks -- Hand gesture recognition for medical purposes using CNN -- Data Mining -- A streaming approach to the Core Vector Machine -- Identifying Cannabis Use Risk through Social Media Based on Deep Learning Methods -- On a Combination of Clustering Methods and Isolation Forest -- K-Medoids-Surv: A patients risk stratification algorithm considering censored data -- A Benchmark of Process Drift Detection Tools: Experimental Protocol and Statistical Analysis -- Improving Solar Flare Prediction by Time Series Outlier Detection -- Various Problems of Artificial Intelligence -- Tourism Stock Prices, Systemic Risk and Tourism Growth: A Kalman Filter with Prior Update DSGE-VAR Model -- An expert system to detect and classify CNS disorders based on eye test data using SVM and Nature-Inspired Algorithms -- Assessment of Semi-Supervised approaches applied to Convolutional Neural Networks -- Bi-Space Search: Optimizing the Hybridization of Search Spaces in Solving the One Dimensional Bin Packing Problem -- Assessing the Sentiment of Book Characteristics Using Machine Learning NLP Models -- Autoencoder neural network for detecting non-human web traffic -- Edge Detection-Based Full-Disc Solar Image Hashing -- Employee Turnover Prediction From Email Communication Analysis -- Buggy Pinball: A Novel Single-point Meta-heuristic for Global Continuous Optimization -- Privacy Preserving by Removing Sensitive Data from Documents with Fully Convolutional Networks -- A New Approach to Statistical Iterative Reconstruction Algorithm for a CT Scanner with Flying Focal Spot Using a Rebinning method -- Algorithm for solving optimal placement of routers in mines -- An Improved Structure-Based Partial Solution Search for the Examination Timetabling Problem -- Human Activity Recognition for Online Examination Environment using CNN -- BIM-based Approach to House Renovation Projects Assessment -- Machine Learning-based Conditioning and Drying of Sewage Sludge as Part of the Management of Co-fermentation Processes -- An efficient algorithm to find a maximum weakly stable matching for SPA-ST problem -- Author Attribution of Literary Texts in Polish by the Sequence Averaging -- Bioinformatics, Biometrics and Medical Applications -- Prediction of Protein Molecular Functions Using Transformers -- Dynamic signature verification using selected regions. |
| Record Nr. | UNINA-9910645892303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
