26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings / Simonis, Helmut  

Público ISBD Ningún comentario para este registro. Título : 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings Tipo de documento: documento electrónico Autores: Simonis, Helmut, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2020 Número de páginas: XV, 972 p. 532 ilustraciones, 140 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-58475-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  Inteligencia artificial  Ingeniería de software  Informática  Simulación por ordenador  Lenguajes formales y teoría de los autómatas  Matemáticas de la Computación  Modelado por computadora Índice Dewey: 5.131 Resumen: Este libro constituye las actas de la 26.ª Conferencia Internacional sobre Principios y Práctica de la Programación de Restricciones, CP 2020, celebrada en Louvain-la-Neuve, Bélgica, en septiembre de 2020. La conferencia se celebró de forma virtual debido a la pandemia de COVID-19. Los 55 artículos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 122 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; y CP y ciencia de datos y aprendizaje automático. Nota de contenido: Technical Track -- Dashed strings and the replace(-all) constraint -- Combinatorial Search in CP-Based Iterated Belief Propagation -- Replication-Guided Enumeration of Minimal Unsatisfiable Subsets -- Solving Satisfaction Problems using Large-Neighbourhood Search -- Quantum-accelerated global constraint ltering -- Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search -- Tractable Fragments of Temporal Sequences of Topological Information -- Strengthening neighbourhood substitution -- Effective Encodings of Constraint Programming Models to SMT -- Watched Propagation of 0-1 Integer Linear Constraints -- Bounding Linear Programs by Constraint Propagation: Application to Max-SAT -- On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs -- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees -- Aggregation and Garbage Collection for Online Optimization -- Treewidth-Aware Quantifier Elimination and Expansion for QCSP -- A Time Leap Challenge for SAT-Solving -- Breaking Symmetries with RootClique and LexTopsort -- Towards Faster Reasoners by using Transparent Huge Pages -- The argmax constraint -- A branch-and-bound algorithm to rigorously enclose the round-off errors -- Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems -- Solving the Group Cumulative Scheduling Problem with CPO and ACO -- Phase Transition Behaviour in Knowledge Compilation -- A Faster Exact Algorithm to Count X3SAT Solutions -- Visualizations to Summarize Search Behavior -- Parallelization of TSP solving in CP -- Using Resolution Proofs to Analyse CDCL Solvers -- Large Neighborhood Search for Temperature Control with Demand Response -- Core-Guided Model Reformulation -- Filtering rules for ow time minimization in a Parallel Machine Scheduling Problem -- MaxSAT-Based Postprocessing for Treedepth -- Effective Perturbations for Constraint Solving -- Finding the Hardest Formulas for Resolution -- HADDOCK: A Language and Architecture for Decision Diagram Compilation -- Towards a Generic Interval Solver for Differential-Algebraic CSP -- abstractXOR: A global constraint dedicated to differential cryptanalysis -- In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem -- Application Track -- Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing -- Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming -- Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry -- RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots -- A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork -- Exact Approaches to the Multi-Agent Collective Construction Problem -- The Confidence Constraint: A Step Towards Stochastic CP Solvers -- Parity (XOR) Reasoning for the Index Calculus Attack -- Constraint-Based Software Diversification forEfficient Mitigation of Code-Reuse Attacks -- CP and Data Science and Machine Learning -- Pushing data into CP models using Graphical Model Learning and Solving -- Generating Random Logic Programs Using Constraint Programming -- Towards Formal Fairness in Machine Learning -- Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions -- Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks -- A Machine Learning based Splitting Heuristic for Divide-and-Conquer Solvers -- Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models -- Omissions in Constraint Acquisition -- Computing Optimal Decision Sets with SAT. 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 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings [documento electrónico] / Simonis, Helmut,  . -  1 ed.  . - [s.l.] : Springer, 2020 . - XV, 972 p. 532 ilustraciones, 140 ilustraciones en color. ISBN : 978-3-030-58475-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  Inteligencia artificial  Ingeniería de software  Informática  Simulación por ordenador  Lenguajes formales y teoría de los autómatas  Matemáticas de la Computación  Modelado por computadora Índice Dewey: 5.131 Resumen: Este libro constituye las actas de la 26.ª Conferencia Internacional sobre Principios y Práctica de la Programación de Restricciones, CP 2020, celebrada en Louvain-la-Neuve, Bélgica, en septiembre de 2020. La conferencia se celebró de forma virtual debido a la pandemia de COVID-19. Los 55 artículos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 122 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; y CP y ciencia de datos y aprendizaje automático. Nota de contenido: Technical Track -- Dashed strings and the replace(-all) constraint -- Combinatorial Search in CP-Based Iterated Belief Propagation -- Replication-Guided Enumeration of Minimal Unsatisfiable Subsets -- Solving Satisfaction Problems using Large-Neighbourhood Search -- Quantum-accelerated global constraint ltering -- Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search -- Tractable Fragments of Temporal Sequences of Topological Information -- Strengthening neighbourhood substitution -- Effective Encodings of Constraint Programming Models to SMT -- Watched Propagation of 0-1 Integer Linear Constraints -- Bounding Linear Programs by Constraint Propagation: Application to Max-SAT -- On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs -- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees -- Aggregation and Garbage Collection for Online Optimization -- Treewidth-Aware Quantifier Elimination and Expansion for QCSP -- A Time Leap Challenge for SAT-Solving -- Breaking Symmetries with RootClique and LexTopsort -- Towards Faster Reasoners by using Transparent Huge Pages -- The argmax constraint -- A branch-and-bound algorithm to rigorously enclose the round-off errors -- Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems -- Solving the Group Cumulative Scheduling Problem with CPO and ACO -- Phase Transition Behaviour in Knowledge Compilation -- A Faster Exact Algorithm to Count X3SAT Solutions -- Visualizations to Summarize Search Behavior -- Parallelization of TSP solving in CP -- Using Resolution Proofs to Analyse CDCL Solvers -- Large Neighborhood Search for Temperature Control with Demand Response -- Core-Guided Model Reformulation -- Filtering rules for ow time minimization in a Parallel Machine Scheduling Problem -- MaxSAT-Based Postprocessing for Treedepth -- Effective Perturbations for Constraint Solving -- Finding the Hardest Formulas for Resolution -- HADDOCK: A Language and Architecture for Decision Diagram Compilation -- Towards a Generic Interval Solver for Differential-Algebraic CSP -- abstractXOR: A global constraint dedicated to differential cryptanalysis -- In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem -- Application Track -- Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing -- Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming -- Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry -- RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots -- A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork -- Exact Approaches to the Multi-Agent Collective Construction Problem -- The Confidence Constraint: A Step Towards Stochastic CP Solvers -- Parity (XOR) Reasoning for the Index Calculus Attack -- Constraint-Based Software Diversification forEfficient Mitigation of Code-Reuse Attacks -- CP and Data Science and Machine Learning -- Pushing data into CP models using Graphical Model Learning and Solving -- Generating Random Logic Programs Using Constraint Programming -- Towards Formal Fairness in Machine Learning -- Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions -- Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks -- A Machine Learning based Splitting Heuristic for Divide-and-Conquer Solvers -- Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models -- Omissions in Constraint Acquisition -- Computing Optimal Decision Sets with SAT. 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) Par page : 25 50 100 200