| Título : |
15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
van Hoeve, Willem-Jan, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2018 |
| Número de páginas: |
XXVI, 616 p. 155 ilustraciones |
| ISBN/ISSN/DL: |
978-3-319-93031-2 |
| 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: |
Sistemas operativos (computadoras) Inteligencia artificial Operating systems Matemáticas discretas en informática Análisis numérico Procesamiento de datos Matemáticas discretas Matemáticas Informática Algoritmo Ciencia de los datos |
| Índice Dewey: |
518 |
| Resumen: |
Este libro constituye las actas de la 15.ª Conferencia internacional sobre integración de técnicas de inteligencia artificial e investigación de operaciones en programación con restricciones para problemas de optimización combinatoria, CPAIOR 2018, celebrada en Delft (Países Bajos) en junio de 2018. Los 47 artículos completos presentados, junto con 3 resúmenes de charlas invitadas y 3 resúmenes de artículos de revistas de publicación acelerada, fueron cuidadosamente revisados y seleccionados de entre 111 presentaciones. La conferencia reúne a investigadores interesados en la programación con restricciones, la inteligencia artificial y la investigación de operaciones para presentar nuevas técnicas o aplicaciones en la intersección de estos campos y brinda una oportunidad para que los investigadores de un área aprendan sobre las técnicas de las otras y demuestren cómo la integración de técnicas de diferentes campos puede conducir a resultados interesantes en problemas grandes y complejos. |
| Nota de contenido: |
Time-bounded Query Generator for Constraint Acquisition -- Propagating lex, Find and Replace with Dashed Strings -- Designing Fair, Effcient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources -- An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science -- Dealing with Demand Uncertainty in Service Network and Load Plan Design -- Energy-Aware Production Scheduling with Power-Saving Modes -- Episode Support: A Global Constraint for Mining Frequent Patterns in A Long Sequence of Events -- Off-line and on-line Optimization Under Uncertainty: A Case Study on Energy Management -- Reasoning on Sequences in Constraint-Based Local Search Frameworks -- Guiding Constraint Programming with Hot Starts for High School Timetabling -- Epiphytic Trees: Relational Consistency Applied to Global Optimization Problems -- Learning Heuristics for the TSP by Policy Gradient -- Three-Dimensional Matching Instances Are Rich in Stable Matchings -- From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP -- Constrained-based Differential Privacy: Releasing Optimal Power Flow Benchmarks Privately -- Chasing First Queens by Integer Programming -- Accelerating Counting-Based Search -- Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study -- Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks -- Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design -- A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem -- Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms -- Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint -- Soft-regular with a Prefix-size Violation Measure -- Constraint and Mathematical Programming for Integrated Port Container Terminal Operations -- Heuristic Variants for A* Search in 3D Flight Planning -- Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia -- Objective Landscapes for Constraint Programming -- An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling -- Modeling and Solving the Senior Transportation Problem -- Solver Independent Rotating Workforce Scheduling -- Greedy Randomized Search for Scalable Compilation of Quantum Circuits -- A Comparison of Optimization Methods for Multi-Objective Constrained Bin Packing Problems -- A O(n log^2 n) Checker and O(n^2 log n) Filtering Algorithm for the Energetic Reasoning -- The Weighted Circuits LMax Constraint -- A Local Search Framework for Compiling Relaxed Decision Diagrams -- Symmetry Breaking Inequalities from the Schreier-Sims table -- Frequency-based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload -- Algorithms for Sparse k-Monotone Regression -- Revisiting the Self-Adaptive Large Neighbourhood Search -- A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs -- Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization -- Learning a Classification of Mixed-Integer Quadratic Programming Problems -- Fleet Scheduling in Underground Mines using Constraint Programming. |
| 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 |
15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings [documento electrónico] / van Hoeve, Willem-Jan, . - 1 ed. . - [s.l.] : Springer, 2018 . - XXVI, 616 p. 155 ilustraciones. ISBN : 978-3-319-93031-2 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Sistemas operativos (computadoras) Inteligencia artificial Operating systems Matemáticas discretas en informática Análisis numérico Procesamiento de datos Matemáticas discretas Matemáticas Informática Algoritmo Ciencia de los datos |
| Índice Dewey: |
518 |
| Resumen: |
Este libro constituye las actas de la 15.ª Conferencia internacional sobre integración de técnicas de inteligencia artificial e investigación de operaciones en programación con restricciones para problemas de optimización combinatoria, CPAIOR 2018, celebrada en Delft (Países Bajos) en junio de 2018. Los 47 artículos completos presentados, junto con 3 resúmenes de charlas invitadas y 3 resúmenes de artículos de revistas de publicación acelerada, fueron cuidadosamente revisados y seleccionados de entre 111 presentaciones. La conferencia reúne a investigadores interesados en la programación con restricciones, la inteligencia artificial y la investigación de operaciones para presentar nuevas técnicas o aplicaciones en la intersección de estos campos y brinda una oportunidad para que los investigadores de un área aprendan sobre las técnicas de las otras y demuestren cómo la integración de técnicas de diferentes campos puede conducir a resultados interesantes en problemas grandes y complejos. |
| Nota de contenido: |
Time-bounded Query Generator for Constraint Acquisition -- Propagating lex, Find and Replace with Dashed Strings -- Designing Fair, Effcient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources -- An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science -- Dealing with Demand Uncertainty in Service Network and Load Plan Design -- Energy-Aware Production Scheduling with Power-Saving Modes -- Episode Support: A Global Constraint for Mining Frequent Patterns in A Long Sequence of Events -- Off-line and on-line Optimization Under Uncertainty: A Case Study on Energy Management -- Reasoning on Sequences in Constraint-Based Local Search Frameworks -- Guiding Constraint Programming with Hot Starts for High School Timetabling -- Epiphytic Trees: Relational Consistency Applied to Global Optimization Problems -- Learning Heuristics for the TSP by Policy Gradient -- Three-Dimensional Matching Instances Are Rich in Stable Matchings -- From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP -- Constrained-based Differential Privacy: Releasing Optimal Power Flow Benchmarks Privately -- Chasing First Queens by Integer Programming -- Accelerating Counting-Based Search -- Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study -- Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks -- Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design -- A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem -- Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms -- Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint -- Soft-regular with a Prefix-size Violation Measure -- Constraint and Mathematical Programming for Integrated Port Container Terminal Operations -- Heuristic Variants for A* Search in 3D Flight Planning -- Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia -- Objective Landscapes for Constraint Programming -- An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling -- Modeling and Solving the Senior Transportation Problem -- Solver Independent Rotating Workforce Scheduling -- Greedy Randomized Search for Scalable Compilation of Quantum Circuits -- A Comparison of Optimization Methods for Multi-Objective Constrained Bin Packing Problems -- A O(n log^2 n) Checker and O(n^2 log n) Filtering Algorithm for the Energetic Reasoning -- The Weighted Circuits LMax Constraint -- A Local Search Framework for Compiling Relaxed Decision Diagrams -- Symmetry Breaking Inequalities from the Schreier-Sims table -- Frequency-based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload -- Algorithms for Sparse k-Monotone Regression -- Revisiting the Self-Adaptive Large Neighbourhood Search -- A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs -- Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization -- Learning a Classification of Mixed-Integer Quadratic Programming Problems -- Fleet Scheduling in Underground Mines using Constraint Programming. |
| 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úsqueda15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018, Proceedings / van Hoeve, Willem-Jan
