25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings / Schiex, Thomas ; de Givry, Simon  

Público ISBD Ningún comentario para este registro. Título : 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings Tipo de documento: documento electrónico Autores: Schiex, Thomas, ; de Givry, Simon, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2019 Número de páginas: XXVI, 788 p. 831 ilustraciones, 179 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-30048-7 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: Teoría de las máquinas  Informática  Inteligencia artificial  Ingeniería de software  Unidades aritméticas y lógicas informáticas  Lenguajes formales y teoría de los autómatas  Matemáticas de la Computación  Estructuras aritméticas y lógicas Índice Dewey: 5.131 Resumen: Este libro constituye las actas de la 25.ª Conferencia Internacional sobre Principios y Práctica de la Programación de Restricciones, CP 2019, celebrada en Stamford, CT, EE. UU., Francia, en septiembre/octubre de 2019. Los 44 artículos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados. de 118 presentaciones. Se ocupan de todos los aspectos de la informática con limitaciones, incluida la teoría, los algoritmos, los entornos, los lenguajes, los modelos, los sistemas y las aplicaciones, como la toma de decisiones, la asignación de recursos, la programación, la configuración y la planificación. Los artículos se organizaron según los siguientes temas/vías: vía técnica; seguimiento de solicitudes; seguimiento de CP paralelo y multiagente; pista de prueba y verificación; Pista de CP y ciencia de datos; sostenibilidad computacional; y pista de CP y ciencias de la vida. Nota de contenido: Technical Track -- Instance Generation via Generator Instances -- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints -- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming -- Vehicle routing by learning from historical solutions -- On Symbolic Approaches for Computing the Matrix Permanent -- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience -- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem -- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics -- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers -- Dual Hashing-based Algorithms for Discrete Integration -- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search -- A Join-Based Hybrid Parameter for Constraint Satisfaction -- An Incremental SAT-BasedApproach to the Graph Colouring Problem -- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving -- Trimming Graphs Using Clausal Proof Optimization -- Improved Job Sequencing Bounds from Decision Diagrams -- Integration of structural constraints into TSP models -- Representing fitness landscapes by valued constraints to understand the complexity of local search -- Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition -- Understanding the Empirical Hardness of Random Optimisation Problems -- Guarded Constraint Models Define Treewidth Preserving Reductions -- Automatic Streamlining for Constrained Optimisation -- Compiling Conditional Constraints -- Training Binarized Neural Networks using MIP and CP -- Application Track -- Models for Radiation Therapy Patient Scheduling -- Constraint Programming-based Job Dispatching for Modern HPC Applications -- Scheduling of Mobile Robots using Constraint Programming -- Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems -- Multi-agent and Parallel CP Track -- An Improved GPU-based SAT Model Counter -- Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems -- Testing and Verification Track -- A Cube Distribution Approach to QBF Solving and Certificate Minimization -- Functional Synthesis with Examples -- SolverCheck: Declarative Testing of Constraints -- Encodings for Enumeration-Based Program Synthesis -- Lemma Synthesis for Automating Induction over Algebraic Data Types -- CP and Data Science Track -- Modeling Pattern Set Mining using Boolean Circuits -- Differential Privacy of Hierarchical Census Data: An Optimization Approach -- Generic Constraint-based Block Modeling using Constraint Programming -- Reward Potentials for Planning with Learned Neural Network Transition Models -- Exploiting Counterfactuals for Scalable Stochastic Optimization -- Structure-driven Multiple Constraint Acquisition -- Computational Sustainability Track -- Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach -- Peak-hour Rail Demand Shifting with Discrete Optimisation -- CP and Life Sciences Track -- Functional significance checking in noisy gene regulatory networks. 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 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings [documento electrónico] / Schiex, Thomas, ; de Givry, Simon,  . -  1 ed.  . - [s.l.] : Springer, 2019 . - XXVI, 788 p. 831 ilustraciones, 179 ilustraciones en color. ISBN : 978-3-030-30048-7 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Palabras clave: Teoría de las máquinas  Informática  Inteligencia artificial  Ingeniería de software  Unidades aritméticas y lógicas informáticas  Lenguajes formales y teoría de los autómatas  Matemáticas de la Computación  Estructuras aritméticas y lógicas Índice Dewey: 5.131 Resumen: Este libro constituye las actas de la 25.ª Conferencia Internacional sobre Principios y Práctica de la Programación de Restricciones, CP 2019, celebrada en Stamford, CT, EE. UU., Francia, en septiembre/octubre de 2019. Los 44 artículos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados. de 118 presentaciones. Se ocupan de todos los aspectos de la informática con limitaciones, incluida la teoría, los algoritmos, los entornos, los lenguajes, los modelos, los sistemas y las aplicaciones, como la toma de decisiones, la asignación de recursos, la programación, la configuración y la planificación. Los artículos se organizaron según los siguientes temas/vías: vía técnica; seguimiento de solicitudes; seguimiento de CP paralelo y multiagente; pista de prueba y verificación; Pista de CP y ciencia de datos; sostenibilidad computacional; y pista de CP y ciencias de la vida. Nota de contenido: Technical Track -- Instance Generation via Generator Instances -- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints -- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming -- Vehicle routing by learning from historical solutions -- On Symbolic Approaches for Computing the Matrix Permanent -- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience -- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem -- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics -- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers -- Dual Hashing-based Algorithms for Discrete Integration -- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search -- A Join-Based Hybrid Parameter for Constraint Satisfaction -- An Incremental SAT-BasedApproach to the Graph Colouring Problem -- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving -- Trimming Graphs Using Clausal Proof Optimization -- Improved Job Sequencing Bounds from Decision Diagrams -- Integration of structural constraints into TSP models -- Representing fitness landscapes by valued constraints to understand the complexity of local search -- Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition -- Understanding the Empirical Hardness of Random Optimisation Problems -- Guarded Constraint Models Define Treewidth Preserving Reductions -- Automatic Streamlining for Constrained Optimisation -- Compiling Conditional Constraints -- Training Binarized Neural Networks using MIP and CP -- Application Track -- Models for Radiation Therapy Patient Scheduling -- Constraint Programming-based Job Dispatching for Modern HPC Applications -- Scheduling of Mobile Robots using Constraint Programming -- Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems -- Multi-agent and Parallel CP Track -- An Improved GPU-based SAT Model Counter -- Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems -- Testing and Verification Track -- A Cube Distribution Approach to QBF Solving and Certificate Minimization -- Functional Synthesis with Examples -- SolverCheck: Declarative Testing of Constraints -- Encodings for Enumeration-Based Program Synthesis -- Lemma Synthesis for Automating Induction over Algebraic Data Types -- CP and Data Science Track -- Modeling Pattern Set Mining using Boolean Circuits -- Differential Privacy of Hierarchical Census Data: An Optimization Approach -- Generic Constraint-based Block Modeling using Constraint Programming -- Reward Potentials for Planning with Learned Neural Network Transition Models -- Exploiting Counterfactuals for Scalable Stochastic Optimization -- Structure-driven Multiple Constraint Acquisition -- Computational Sustainability Track -- Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach -- Peak-hour Rail Demand Shifting with Discrete Optimisation -- CP and Life Sciences Track -- Functional significance checking in noisy gene regulatory networks. 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

---

1 (1 - 1 / 1) Por página: 25 50 100 200