| Título : |
16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Rousseau, Louis-Martin, ; Stergiou, Kostas, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2019 |
| Número de páginas: |
XX, 662 p. 389 ilustraciones, 91 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-19212-9 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Inteligencia artificial Compiladores e intérpretes Análisis numérico Informática Algoritmo Modelos de Computación Compiladores (programas informáticos) |
| Índice Dewey: |
518 |
| Resumen: |
Este libro constituye las actas de la 16.ª Conferencia Internacional sobre Integración de Programación Restringida, Inteligencia Artificial e Investigación de Operaciones, CPAIOR 2019, celebrada en Salónica, Grecia, en junio de 2019. Los 34 artículos completos presentados junto con 9 artículos breves fueron cuidadosamente revisados y seleccionado entre 94 presentaciones. La conferencia reúne a investigadores interesados de Programación de Restricciones (CP), Inteligencia Artificial (IA) e Investigación de Operaciones (OR) para presentar nuevas técnicas o aplicaciones y brindar una oportunidad para que los investigadores de un área aprendan sobre técnicas de otras. Un objetivo principal de esta serie de conferencias es también brindar a estos investigadores la oportunidad de mostrar cómo la integración de técnicas de diferentes campos puede conducir a resultados interesantes sobre problemas grandes y complejos. |
| Nota de contenido: |
Constraint Programming for Dynamic Symbolic Execution of JavaScript -- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms -- Core-Boosted Linear Search for Incomplete MaxSAT solving -- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation -- Local Rapid Learning for Integer Programs -- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming -- Generating Compound Moves in Local Search by Hybridisation with Complete Search -- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations -- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows -- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem -- Evaluating Ising Processing Units with Integer Programming -- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems -- A Counting-Based Approach to Scalable Micro-service Deployment -- An Optimization Approach to the Ordering Phase of an Attended Home DeliveryService -- Consistency for 0-1 Programming -- Prediction + Optimization for the Knapsack Problem -- The maximum weighted submatrix coverage problem: A CP approach -- Learning MILP Resolution Outcomes Before Reaching Time-Limit -- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem -- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling -- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem -- Optimality Clue for Graph Coloring Problem -- Computing Wasserstein Barycenters via Linear Programming -- Repairing Learned Controllers with Convex Optimization: a Case Study -- A Hybrid Approach for Exact Coloring of Massive Graphs -- Modelling and Solving the Minimum Shift Design Problem -- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem -- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications -- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming -- Heat Exchanger Circuitry Design by Decision Diagrams -- A Column Generation for Online Ride-Sharing Services -- Some experiments with submodular function maximization via integer programming -- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation -- Last-Mile Scheduling Under Uncertainty -- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores -- Deep Inverse Optimization -- A Study on the Traveling Salesman Problem with a Drone -- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams -- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams -- Arc Consistency Revisited -- Embedding Decision Diagrams into Generative Adversarial Networks -- Time Table Edge Finding with Energy Variables -- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings [documento electrónico] / Rousseau, Louis-Martin, ; Stergiou, Kostas, . - 1 ed. . - [s.l.] : Springer, 2019 . - XX, 662 p. 389 ilustraciones, 91 ilustraciones en color. ISBN : 978-3-030-19212-9 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Inteligencia artificial Compiladores e intérpretes Análisis numérico Informática Algoritmo Modelos de Computación Compiladores (programas informáticos) |
| Índice Dewey: |
518 |
| Resumen: |
Este libro constituye las actas de la 16.ª Conferencia Internacional sobre Integración de Programación Restringida, Inteligencia Artificial e Investigación de Operaciones, CPAIOR 2019, celebrada en Salónica, Grecia, en junio de 2019. Los 34 artículos completos presentados junto con 9 artículos breves fueron cuidadosamente revisados y seleccionado entre 94 presentaciones. La conferencia reúne a investigadores interesados de Programación de Restricciones (CP), Inteligencia Artificial (IA) e Investigación de Operaciones (OR) para presentar nuevas técnicas o aplicaciones y brindar una oportunidad para que los investigadores de un área aprendan sobre técnicas de otras. Un objetivo principal de esta serie de conferencias es también brindar a estos investigadores la oportunidad de mostrar cómo la integración de técnicas de diferentes campos puede conducir a resultados interesantes sobre problemas grandes y complejos. |
| Nota de contenido: |
Constraint Programming for Dynamic Symbolic Execution of JavaScript -- Sequential and Parallel Solution-Biased Search for Subgraph Algorithms -- Core-Boosted Linear Search for Incomplete MaxSAT solving -- Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation -- Local Rapid Learning for Integer Programs -- A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming -- Generating Compound Moves in Local Search by Hybridisation with Complete Search -- SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations -- A Constraint Programming Approach to Electric Vehicle Routing with Time Windows -- A Sampling-free Anticipatory Algorithm for the Kidney Exchange Problem -- Evaluating Ising Processing Units with Integer Programming -- Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems -- A Counting-Based Approach to Scalable Micro-service Deployment -- An Optimization Approach to the Ordering Phase of an Attended Home DeliveryService -- Consistency for 0-1 Programming -- Prediction + Optimization for the Knapsack Problem -- The maximum weighted submatrix coverage problem: A CP approach -- Learning MILP Resolution Outcomes Before Reaching Time-Limit -- An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem -- Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling -- An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem -- Optimality Clue for Graph Coloring Problem -- Computing Wasserstein Barycenters via Linear Programming -- Repairing Learned Controllers with Convex Optimization: a Case Study -- A Hybrid Approach for Exact Coloring of Massive Graphs -- Modelling and Solving the Minimum Shift Design Problem -- A Computational Comparison of Optimization Methods for the Golomb Ruler Problem -- A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications -- Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming -- Heat Exchanger Circuitry Design by Decision Diagrams -- A Column Generation for Online Ride-Sharing Services -- Some experiments with submodular function maximization via integer programming -- Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation -- Last-Mile Scheduling Under Uncertainty -- Building Optimal Steiner Trees on Supercomputers by using up to 43,000 Cores -- Deep Inverse Optimization -- A Study on the Traveling Salesman Problem with a Drone -- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams -- Extending Compact-MDD to Basic Smart Multi-Valued Variable Diagrams -- Arc Consistency Revisited -- Embedding Decision Diagrams into Generative Adversarial Networks -- Time Table Edge Finding with Energy Variables -- Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
Hacer una sugerencia Refinar búsqueda16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings / Rousseau, Louis-Martin ; Stergiou, Kostas
