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.
Artificial Intelligence for Neuroscience and Emotional Systems : 10th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2024, Olhâo, Portugal, June 4–7, 2024, Proceedings, Part I / / edited by José Manuel Ferrández Vicente, Mikel Val Calvo, Hojjat Adeli
| Artificial Intelligence for Neuroscience and Emotional Systems : 10th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2024, Olhâo, Portugal, June 4–7, 2024, Proceedings, Part I / / edited by José Manuel Ferrández Vicente, Mikel Val Calvo, Hojjat Adeli |
| Autore | Ferrández Vicente José Manuel |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (560 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) |
Val CalvoMikel
AdeliHojjat |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer networks Artificial intelligence Image processing - Digital techniques Computer vision Social sciences - Data processing Theory of Computation Computer Communication Networks Artificial Intelligence Computer Imaging, Vision, Pattern Recognition and Graphics Computer Application in Social and Behavioral Sciences Intel·ligència artificial Visió per ordinador Processament digital d'imatges Xarxes d'ordinadors Teoria de la computació |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031611407
3031611403 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Machine learning in neuroscience -- artificial intelligence in neurophysiology -- neuromotor and cognitive disorders -- intelligent systems for assessment, treatment, and assistance in early stages of Alzheimer's disease and other dementias -- socio-cognitive, affective and physiological computing -- affective computing and context awareness in ambientintelliigence -- learning tools to lecture. |
| Record Nr. | UNINA-9910865264203321 |
Ferrández Vicente José Manuel
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Bioinspired Systems for Translational Applications: From Robotics to Social Engineering : 10th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2024, Olhâo, Portugal, June 4–7, 2024, Proceedings, Part II / / edited by José Manuel Ferrández Vicente, Mikel Val Calvo, Hojjat Adeli
| Bioinspired Systems for Translational Applications: From Robotics to Social Engineering : 10th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2024, Olhâo, Portugal, June 4–7, 2024, Proceedings, Part II / / edited by José Manuel Ferrández Vicente, Mikel Val Calvo, Hojjat Adeli |
| Autore | Ferrández Vicente José Manuel |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (553 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) |
Val CalvoMikel
AdeliHojjat |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer networks Artificial intelligence Image processing - Digital techniques Computer vision Social sciences - Data processing Theory of Computation Computer Communication Networks Artificial Intelligence Computer Imaging, Vision, Pattern Recognition and Graphics Computer Application in Social and Behavioral Sciences |
| ISBN |
9783031611377
3031611373 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Machine learning in computer vision and robotics -- bio-inspired computing approaches -- social and civil engineering through human AI translations -- smart renewable energies: advancing AI algorithms in the renewable energy industry -- bioinspired applications. |
| Record Nr. | UNINA-9910865263403321 |
|
Ferrández Vicente José Manuel
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization : 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22–24, 2024, Revised Selected Papers / / edited by Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González
| Combinatorial Optimization : 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22–24, 2024, Revised Selected Papers / / edited by Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González |
| Autore | Basu Amitabh |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (425 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) |
MahjoubAli Ridha
Salazar GonzálezJuan José |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Computer networks Algorithms Data structures (Computer science) Information theory Numerical analysis Artificial intelligence Discrete Mathematics in Computer Science Computer Communication Networks Design and Analysis of Algorithms Data Structures and Information Theory Numerical Analysis Artificial Intelligence |
| ISBN | 3-031-60924-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Integer Programming -- On disjunction convex hulls by lifting -- On a geometric graph-covering problem related to optimal safety-landing site location -- Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem -- A Family of Spanning-Tree Formulations for the Maximum Cut Problem -- Optimal cycle selections: An experimental assessment of integer programming formulations -- 1-Persistency of the clique relaxation of the stable set polytope -- Alternating direction method and deep learning for discrete control with storage -- Branch and Cut for Partitioning a Graph into a Cycle of Clusters -- Graph Theory -- Computing the Edge Expansion of a Graph using Semidefinite Programming -- Minimizing External Vertices in Hypergraph Orientations -- Open-separating dominating codes in graphs -- On the complexity of the minimum chromatic violation problem -- Crystal Trees -- Parameterized Algorithms -- Reducing Treewidth for SAT-related Problems using Simple Liftings -- Total Matching and Subdeterminants -- A new structural parameter on single machine scheduling with release dates and deadlines -- Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs -- Approximation Algorithms -- Sequencing Stochastic Jobs with a Single Sample -- The Thief Orienteering Problem on Series-Parallel Graphs -- Approximation Algorithm for Job Scheduling with Reconfigurable Resources -- Network Design on Undirected Series-Parallel Graphs -- Online Graph Coloring with Predictions -- Integer Programming for Machine Learning -- Neuron pairs in binarized neural networks robustness verification via integer linear programming -- Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming -- Applications -- Surrogate Constraints for Synchronized Energy Production/Consumption -- A Robust Two-stage Model For the Urban Air Mobility Flight Scheduling Problem -- Optimal charging station location in a linear cycle path with deviations -- An efficient timing algorithm for drivers with rest periods -- Fair Energy Allocation for Collective Self-Consumption -- Day-ahead lot-sizing under uncertainty: An application to green hydrogen production. |
| Record Nr. | UNINA-9910864188203321 |
|
Basu Amitabh
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell |
| Autore | Kobayashi Naoki |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (283 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) | WorrellJames |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Mathematical logic Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57231-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Types and Programming Languages -- From Rewrite Rules to Axioms in the lambdaPi-Calculus Modulo Theory -- Light Genericity -- Logical Predicates in Higher-Order Mathematical Operational Semantics -- On Basic Feasible Functionals and the Interpretation Method -- Logic and Proofs -- Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems -- A Resolution-Based Interactive Proof System for UNSAT -- Craig Interpolation for Decidable First-Order Fragments -- Clones, closed categories, and combinatory logic -- Infinite-State Systems -- Reachability in Fixed VASS: Expressiveness and Lower Bounds -- From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting -- Dimension-Minimality and Primality of Counter Nets -- Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability. |
| Record Nr. | UNISA-996594169203316 |
|
Kobayashi Naoki
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell |
| Autore | Kobayashi Naoki |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (283 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) | WorrellJames |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57231-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Types and Programming Languages -- From Rewrite Rules to Axioms in the lambdaPi-Calculus Modulo Theory -- Light Genericity -- Logical Predicates in Higher-Order Mathematical Operational Semantics -- On Basic Feasible Functionals and the Interpretation Method -- Logic and Proofs -- Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems -- A Resolution-Based Interactive Proof System for UNSAT -- Craig Interpolation for Decidable First-Order Fragments -- Clones, closed categories, and combinatory logic -- Infinite-State Systems -- Reachability in Fixed VASS: Expressiveness and Lower Bounds -- From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting -- Dimension-Minimality and Primality of Counter Nets -- Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability. |
| Record Nr. | UNINA-9910847392703321 |
|
Kobayashi Naoki
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (290 pages) |
| Disciplina | 40,151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Mathematical logic Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57228-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Ackermannian Completion of Separators -- Infinite Games -- Fair Omega-regular Games -- Stochastic Window Mean-Payoff Games -- Symbolic Solution of Emerson-Lei Games for Reactive Synthesis -- Parity Games on Temporal Graphs -- Categorical Semantics -- Drawing from an Urn is Isometric -- Enriching Diagrams with Algebraic Operations -- Monoidal Extended Stone Duality -- Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory) -- Automata and Synthesis -- Determinization of Integral Discounted-Sum Automata is Decidable -- Checking History-Determinism is NP-hard for Parity Automata -- Tighter Construction of Tight Büchi Automata -- Synthesis with Privacy Against an Observer. |
| Record Nr. | UNISA-996594169803316 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (290 pages) |
| Disciplina | 40,151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57228-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Ackermannian Completion of Separators -- Infinite Games -- Fair Omega-regular Games -- Stochastic Window Mean-Payoff Games -- Symbolic Solution of Emerson-Lei Games for Reactive Synthesis -- Parity Games on Temporal Graphs -- Categorical Semantics -- Drawing from an Urn is Isometric -- Enriching Diagrams with Algebraic Operations -- Monoidal Extended Stone Duality -- Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory) -- Automata and Synthesis -- Determinization of Integral Discounted-Sum Automata is Decidable -- Checking History-Determinism is NP-hard for Parity Automata -- Tighter Construction of Tight Büchi Automata -- Synthesis with Privacy Against an Observer. |
| Record Nr. | UNINA-9910847596403321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integer Programming and Combinatorial Optimization : 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3–5, 2024, Proceedings / / edited by Jens Vygen, Jarosław Byrka
| Integer Programming and Combinatorial Optimization : 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3–5, 2024, Proceedings / / edited by Jens Vygen, Jarosław Byrka |
| Autore | Vygen Jens |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (474 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) | ByrkaJarosław |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Mathematics - Data processing Discrete mathematics Application software Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Computer and Information Systems Applications |
| ISBN | 3-031-59835-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sparsity and integrality gap transference bounds for integer programs -- Separating k-Median from the Supplier Version -- A Better-Than-1.6-Approximation for Prize-Collecting TSP -- On Matrices over a Polynomial Ring with Restricted Subdeterminants -- A First Order Method for Linear Programming Parameterized by Circuit Imbalance -- Approximately Packing Dijoins via Nowhere-Zero Flows -- Capacitated Facility Location with Outliers and Uniform Facility Costs -- Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones -- The Extension Complexity of Polytopes with Bounded Integral Slack Matrices -- Assortment Optimization with Visibility Constraints -- Adaptivity Gaps in Two-sided Assortment Optimization -- Two-Stage Stochastic Stable Matching -- Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory -- Fully-Dynamic Load Balancing -- Pairwise-Independent Contention Resolution -- An FPTAS for Connectivity Interdiction -- Tight Lower Bounds for Block-Structured Integer Programs -- A Lower Bound for the Max Entropy Algorithm for TSP -- On the Number of Degenerate Simplex Pivots -- On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms -- On the Congruency-Constrained Matroid Base -- Online Combinatorial Assignment in Independence Systems -- Decomposing Probability Marginals Beyond Affine Requirements -- Polynomial Algorithms to Minimize 2/3-Submodular Functions -- A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs -- Extending the primal-dual 2-approximation algorithm beyond uncrossable set families -- Network Flow Problems with Electric Vehicles -- Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack -- Relaxation strength for multilinear optimization: McCormick strikes back -- Online Algorithms for Spectral Hypergraph Sparsification -- Fast Combinatorial Algorithms for Efficient Sortation -- A New Branching Rule for Range Minimization Problems -- Sensitivity analysis for mixed binary quadratic programming. |
| Record Nr. | UNINA-9910864195903321 |
|
Vygen Jens
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part II / / edited by Bistra Dilkina
| Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part II / / edited by Bistra Dilkina |
| Autore | Dilkina Bistra |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (332 pages) |
| Disciplina | 40,151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Artificial intelligence Computer science Computer networks Mathematics of Computing Artificial Intelligence Theory of Computation Computer Communication Networks |
| ISBN |
9783031605994
3031605993 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Core Boosting in SAT-Based Multi-Objective Optimization -- Fair Minimum Representation Clustering -- Proof Logging for the Circuit Constraint -- Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model -- Lookahead, Merge and Reduce for Compiling Relaxed Decision Diagrams for Optimization -- LEO: Learning Efficient Orderings for Multiobjective BDDs -- Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches -- Learning Deterministic Surrogates for Robust Convex QCQP -- Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin -- Improving Metaheuristic Effciency for Stochastic Optimization Problems by Sequential Predictive Sampling -- SMT-based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability -- CaVE: A Cone-aligned Approach for Fast Predict-then-optimize with Binary Linear Programs -- A Constraint Programming Approach for Aircraft Disassembly Scheduling -- Optimization Over Trained Neural Networks: Taking a Relaxing Walk -- Learning From Scenarios for Repairable Stochastic Scheduling -- Explainable Algorithm Selection for the Capacitated Lot Sizing Problem -- Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems -- Robustness Verification in Neural Networks -- An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems -- Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification -- Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs. |
| Record Nr. | UNINA-9910864197503321 |
|
Dilkina Bistra
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part I / / edited by Bistra Dilkina
| Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 21st International Conference, CPAIOR 2024, Uppsala, Sweden, May 28–31, 2024, Proceedings, Part I / / edited by Bistra Dilkina |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (XIV, 349 p. 79 illus., 68 illus. in color.) |
| Disciplina | 40,151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Artificial intelligence Computer science Computer networks Mathematics of Computing Artificial Intelligence Theory of Computation Computer Communication Networks |
| ISBN | 3-031-60597-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Online optimization of a dial-a-ride problem with the integral primal simplex -- A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints -- Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem -- Effciently Mining Closed Interval Patterns with Constraint Programming -- Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue -- Single Constant Multiplication for SAT -- Towards a Generic Representation of Combinatorial -- Problems for Learning-Based Approaches -- Accelerating Continuous Variable Coherent Ising Machines via Momentum -- Decision-focused predictions via pessimistic bilevel optimization: a computational study -- Bi-Objective Discrete Graphical Model Optimization -- An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis -- UNSAT Solver Synthesis via Monte Carlo Forest Search -- A hybrid approach integrating Generalized Arc Consistency and Differential Evolution for global optimization -- Assessing Group Fairness with Social Welfare Optimization -- Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams -- ViolationLS: Constraint-Based Local Search in CP-SAT -- ULD Build-Up Scheduling with Logic-Based Benders Decomposition -- A decomposition approach for a capacitated multi-vehicle covering tour problem with intermediate facilities -- Don’t Explain Noise: Robust Counterfactuals for Randomized Ensembles -- Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs -- Learning to Solve Job Shop Scheduling under Uncertainty. |
| Record Nr. | UNINA-9910864178903321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
