top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Applications of Operational Research in Business and Industries [[electronic resource] ] : Proceedings of 54th Annual Conference of ORSI / / edited by Angappa Gunasekaran, Jai Kishore Sharma, Samarjit Kar
Applications of Operational Research in Business and Industries [[electronic resource] ] : Proceedings of 54th Annual Conference of ORSI / / edited by Angappa Gunasekaran, Jai Kishore Sharma, Samarjit Kar
Autore Gunasekaran Angappa
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (512 pages)
Disciplina 658.4034
Altri autori (Persone) SharmaJai Kishore
KarSamarjit
Collana Lecture Notes in Operations Research
Soggetto topico Operations research
Mathematical optimization
Big data
Machine learning
Artificial intelligence—Data processing
Operations Research and Decision Theory
Optimization
Big Data
Machine Learning
Data Science
Soggetto non controllato Technology
Technology & Engineering
ISBN 9789811980121
9789811980114
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Chapter 1: Optimization of an inventory model with demand dependent on selling price and stock, nonlinear holding cost along with trade credit policy -- Chapter 2: Software Defect Prediction Through a Hybrid Approach Comprising of a Statistical Tool and a Machine Learning Model -- Chapter 3: Conservation of a prey species through optimal taxation: a model with Beddington-DeAngelis Functional Response -- Chapter 4: Investigate the reason for students' absenteeism in Engineering College in Fuzzy MCDM environment -- Chapter 5: Optimal inventory management policies for substitutable products considering non-instantaneous decay and cost of substitution. .
Record Nr. UNINA-9910726276403321
Gunasekaran Angappa  
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied Data Science in Tourism : Interdisciplinary Approaches, Methodologies, and Applications / / edited by Roman Egger
Applied Data Science in Tourism : Interdisciplinary Approaches, Methodologies, and Applications / / edited by Roman Egger
Edizione [1st ed. 2022.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Descrizione fisica 1 online resource (647 pages)
Disciplina 338.4791
338.4791028557
Collana Tourism on the Verge
Soggetto topico Tourism
Management
Artificial intelligence - Data processing
Statistics
Tourism Management
Data Science
Statistics in Business, Management, Economics, Finance, Insurance
ISBN 9783030883898
9783030883881
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part I: Theoretical Fundaments -- AI and Big Data in Tourism -- Epistemological Challenges -- Data Science and Interdisciplinarity -- Data Science and Ethical Issues -- Web Scraping -- Part II: Machine Learning -- Machine Learning in Tourism: A Brief Overview -- Feature Engineering -- Clustering -- Dimensionality Reduction -- Classification -- Regression -- Hyperparameter Tuning -- Model Evaluation -- Interpretability of Machine Learning Models -- Part III: Natural Language Processing -- Natural Language Processing (NLP): An Introduction -- Text Representations and Word Embeddings -- Sentiment Analysis -- Topic Modelling -- Entity Matching: Matching Entities Between Multiple Data Sources -- Knowledge Graphs -- Part IV: Additional Methods -- Network Analysis -- Time Series Analysis -- Agent-Based Modelling -- Geographic Information System (GIS) -- Visual Data Analysis -- Software and Tools.
Record Nr. UNINA-9910735382503321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Apply Data Science [[electronic resource] ] : Introduction, Applications and Projects / / edited by Thomas Barton, Christian Müller
Apply Data Science [[electronic resource] ] : Introduction, Applications and Projects / / edited by Thomas Barton, Christian Müller
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Vieweg, , 2023
Descrizione fisica 1 online resource (233 pages)
Disciplina 005.7
Soggetto topico Artificial intelligence—Data processing
Information storage and retrieval systems
Data mining
Business information services
Business—Data processing
Big data
Data Science
Information Storage and Retrieval
Data Mining and Knowledge Discovery
IT in Business
Business Informatics
Big Data
ISBN 3-658-38798-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Introduction to Data Science -- Systems, Tools and Methods -- Applications.
Record Nr. UNISA-996547963203316
Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Vieweg, , 2023
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Apply Data Science : Introduction, Applications and Projects / / edited by Thomas Barton, Christian Müller
Apply Data Science : Introduction, Applications and Projects / / edited by Thomas Barton, Christian Müller
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Vieweg, , 2023
Descrizione fisica 1 online resource (233 pages)
Disciplina 005.7
Soggetto topico Artificial intelligence—Data processing
Information storage and retrieval systems
Data mining
Business information services
Business—Data processing
Big data
Data Science
Information Storage and Retrieval
Data Mining and Knowledge Discovery
IT in Business
Business Informatics
Big Data
ISBN 3-658-38798-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Introduction to Data Science -- Systems, Tools and Methods -- Applications.
Record Nr. UNINA-9910637710203321
Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Vieweg, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (X, 329 p. 42 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
Computer networks
Computer graphics
Discrete Mathematics in Computer Science
Numerical Analysis
Data Science
Computer Communication Networks
Computer Graphics
ISBN 3-319-89441-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications.
Record Nr. UNISA-996466231403316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms [[electronic resource] ] : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach
Approximation and Online Algorithms [[electronic resource] ] : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (X, 349 p. 39 illus., 22 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Numerical analysis
Computer engineering
Computer networks
Discrete Mathematics in Computer Science
Data Science
Numerical Analysis
Computer Engineering and Networks
ISBN 3-030-04693-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Fréchet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfiguration of Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.
Record Nr. UNISA-996466188003316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
Approximation and Online Algorithms : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (X, 329 p. 42 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
Computer networks
Computer graphics
Discrete Mathematics in Computer Science
Numerical Analysis
Data Science
Computer Communication Networks
Computer Graphics
ISBN 3-319-89441-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications.
Record Nr. UNINA-9910349424403321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach
Approximation and Online Algorithms : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (X, 349 p. 39 illus., 22 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Numerical analysis
Computer engineering
Computer networks
Discrete Mathematics in Computer Science
Data Science
Numerical Analysis
Computer Engineering and Networks
ISBN 3-030-04693-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Fréchet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfiguration of Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.
Record Nr. UNINA-9910349389403321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms [[electronic resource] ] : 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers / / edited by Klaus Jansen, Monaldo Mastrolilli
Approximation and Online Algorithms [[electronic resource] ] : 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers / / edited by Klaus Jansen, Monaldo Mastrolilli
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XIV, 211 p. 23 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Numerical analysis
Discrete Mathematics in Computer Science
Data Science
Numerical Analysis
ISBN 3-319-51741-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms for the k-Set Packing Problem -- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization -- The Shortest Separating Cycle Problem -- Dynamic Traveling Repair Problem with an Arbitrary Time Window -- A PTAS for the Cluster Editing Problem on Planar Graphs -- Bin Packing with Colocations -- Batch Coloring of Graphs -- New Integrality Gap Results for the Firefighters Problem on Trees -- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs -- Balanced Optimization with Vector Costs -- Vertex Sparsification in Trees -- Scenario Submodular Cover -- Non-Greedy Online Steiner Trees on Outerplanar Graphs -- A Refined Analysis of Online Path Coloring in Trees -- Resource Allocation Games with Multiple Resource Classes -- Tight Approximation Bounds for the Seminar Assignment Problem -- A Priori TSP in the Scenario Model -- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. .
Record Nr. UNISA-996466083503316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms : 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers / / edited by Klaus Jansen, Monaldo Mastrolilli
Approximation and Online Algorithms : 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers / / edited by Klaus Jansen, Monaldo Mastrolilli
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XIV, 211 p. 23 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Numerical analysis
Discrete Mathematics in Computer Science
Data Science
Numerical Analysis
ISBN 3-319-51741-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms for the k-Set Packing Problem -- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization -- The Shortest Separating Cycle Problem -- Dynamic Traveling Repair Problem with an Arbitrary Time Window -- A PTAS for the Cluster Editing Problem on Planar Graphs -- Bin Packing with Colocations -- Batch Coloring of Graphs -- New Integrality Gap Results for the Firefighters Problem on Trees -- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs -- Balanced Optimization with Vector Costs -- Vertex Sparsification in Trees -- Scenario Submodular Cover -- Non-Greedy Online Steiner Trees on Outerplanar Graphs -- A Refined Analysis of Online Path Coloring in Trees -- Resource Allocation Games with Multiple Resource Classes -- Tight Approximation Bounds for the Seminar Assignment Problem -- A Priori TSP in the Scenario Model -- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. .
Record Nr. UNINA-9910484212103321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui