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.
Data Mining and Constraint Programming [[electronic resource] ] : Foundations of a Cross-Disciplinary Approach / / edited by Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O'Sullivan, Dino Pedreschi
| Data Mining and Constraint Programming [[electronic resource] ] : Foundations of a Cross-Disciplinary Approach / / edited by Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O'Sullivan, Dino Pedreschi |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XII, 349 p. 73 illus.) |
| Disciplina | 006.312 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Application software Computer simulation Algorithms Database management Data mining Artificial Intelligence Information Systems Applications (incl. Internet) Simulation and Modeling Algorithm Analysis and Problem Complexity Database Management Data Mining and Knowledge Discovery |
| ISBN | 3-319-50137-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction to Combinatorial Optimisation in Numberjack -- Data Mining and Constraints: An Overview -- New Approaches to Constraint Acquisition -- ModelSeeker: Extracting Global Constraint Models from Positive Examples -- Learning Constraint Satisfaction Problems: An ILP Perspective -- Learning Modulo Theories -- Algorithm Selection for Combinatorial Search Problems: A Survey -- Adapting Consistency in Constraint Solving -- Modeling in MiningZinc -- Partition-Based Clustering Using Constraint Optimisation -- The Inductive Constraint Programming Loop -- ICON Loop Carpooling Show Case -- ICON Loop Health Show Case -- ICON Loop Energy Show Case. |
| Record Nr. | UNISA-996465760103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Data Mining and Constraint Programming : Foundations of a Cross-Disciplinary Approach / / edited by Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O'Sullivan, Dino Pedreschi
| Data Mining and Constraint Programming : Foundations of a Cross-Disciplinary Approach / / edited by Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O'Sullivan, Dino Pedreschi |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XII, 349 p. 73 illus.) |
| Disciplina | 006.312 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Application software Computer simulation Algorithms Database management Data mining Artificial Intelligence Information Systems Applications (incl. Internet) Simulation and Modeling Algorithm Analysis and Problem Complexity Database Management Data Mining and Knowledge Discovery |
| ISBN | 3-319-50137-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction to Combinatorial Optimisation in Numberjack -- Data Mining and Constraints: An Overview -- New Approaches to Constraint Acquisition -- ModelSeeker: Extracting Global Constraint Models from Positive Examples -- Learning Constraint Satisfaction Problems: An ILP Perspective -- Learning Modulo Theories -- Algorithm Selection for Combinatorial Search Problems: A Survey -- Adapting Consistency in Constraint Solving -- Modeling in MiningZinc -- Partition-Based Clustering Using Constraint Optimisation -- The Inductive Constraint Programming Loop -- ICON Loop Carpooling Show Case -- ICON Loop Health Show Case -- ICON Loop Energy Show Case. |
| Record Nr. | UNINA-9910484464303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Principles and Practice of Constraint Programming - CP 2007 [[electronic resource] ] : 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings / / edited by Christian Bessiere
| Principles and Practice of Constraint Programming - CP 2007 [[electronic resource] ] : 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings / / edited by Christian Bessiere |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XV, 887 p.) |
| Disciplina | 005.1/16 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Artificial intelligence Computer logic Mathematical logic Software Engineering/Programming and Operating Systems Programming Techniques Programming Languages, Compilers, Interpreters Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-74970-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Caching in Backtracking Search -- Of Mousetraps and Men: A Cautionary Tale -- Application Papers -- Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite -- Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques -- Solving the Salinity Control Problem in a Potable Water System -- Exploring Different Constraint-Based Modelings for Program Verification -- An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing -- An Efficient Model and Strategy for the Steel Mill Slab Design Problem -- Constraint-Based Temporal Reasoning for E-Learning with LODE -- Scheduling for Cellular Manufacturing -- Full Research Papers -- A Constraint Store Based on Multivalued Decision Diagrams -- GAC Via Unit Propagation -- Solution Directed Backjumping for QCSP -- Reformulating CSPs for Scalability with Application to Geospatial Reasoning -- A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects -- Local Symmetry Breaking During Search in CSPs -- Encodings of the Sequence Constraint -- On Inconsistent Clause-Subsets for Max-SAT Solving -- An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming -- Tradeoffs in the Complexity of Backdoor Detection -- Model-Driven Visualizations of Constraint-Based Local Search -- Dealing with Incomplete Preferences in Soft Constraint Problems -- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure -- MUST: Provide a Finer-Grained Explanation of Unsatisfiability -- An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search -- Limitations of Restricted Branching in Clause Learning -- Dynamic Management of Heuristics for Solving Structured CSPs -- A Compression Algorithm for Large Arity Extensional Constraints -- Valid Inequality Based Lower Bounds for WCSP -- Advisors for Incremental Propagation -- Breaking Symmetry of Interchangeable Variables and Values -- Path Consistency by Dual Consistency -- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance -- Scheduling Conditional Task Graphs -- Towards Robust CNF Encodings of Cardinality Constraints -- AND/OR Multi-valued Decision Diagrams for Constraint Optimization -- Parallelizing Constraint Programs Transparently -- MiniZinc: Towards a Standard CP Modelling Language -- Propagation = Lazy Clause Generation -- Boosting Probabilistic Choice Operators -- A Multi-engine Solver for Quantified Boolean Formulas -- Decomposing Global Grammar Constraints -- Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT -- Bound-Consistent Deviation Constraint -- Constructive Interval Disjunction -- An LP-Based Heuristic for Optimal Planning -- A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs -- On Universal Restart Strategies for Backtracking Search -- Hierarchical Hardness Models for SAT -- SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT -- Filtering for Subgraph Isomorphism -- Solution Counting Algorithms for Constraint-Centered Search Heuristics -- Min-Domain Ordering for Asynchronous Backtracking -- Short Research Papers -- Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario -- Uncertainty in Bipolar Preference Problems -- An Analysis of Slow Convergence in Interval Propagation -- The Expressive Power of Valued Constraints: Hierarchies and Collapses -- Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks -- The Log-Support Encoding of CSP into SAT -- Groupoids and Conditional Symmetry -- Sampling Strategies and Variable Selection in Weighted Degree Heuristics -- A Case for Simple SAT Solvers -- CP-Based Local Branching -- Strong Controllability of Disjunctive Temporal Problems with Uncertainty -- Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms -- Constraint Symmetry for the Soft CSP -- Breaking Value Symmetry. |
| Record Nr. | UNISA-996465584103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Principles and practice of constraint programming--CP 2007 : 13th international conference, CP 2007, Providence, RI, USA, September 23-27, 2007 : proceedings / / Christian Bessiere (ed.)
| Principles and practice of constraint programming--CP 2007 : 13th international conference, CP 2007, Providence, RI, USA, September 23-27, 2007 : proceedings / / Christian Bessiere (ed.) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2007 |
| Descrizione fisica | 1 online resource (XV, 887 p.) |
| Disciplina | 005.1/16 |
| Altri autori (Persone) | BessiereChristian |
| Collana | Lecture notes in computer science |
| Soggetto topico | Constraint programming (Computer science) |
| ISBN | 3-540-74970-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Caching in Backtracking Search -- Of Mousetraps and Men: A Cautionary Tale -- Application Papers -- Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite -- Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques -- Solving the Salinity Control Problem in a Potable Water System -- Exploring Different Constraint-Based Modelings for Program Verification -- An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing -- An Efficient Model and Strategy for the Steel Mill Slab Design Problem -- Constraint-Based Temporal Reasoning for E-Learning with LODE -- Scheduling for Cellular Manufacturing -- Full Research Papers -- A Constraint Store Based on Multivalued Decision Diagrams -- GAC Via Unit Propagation -- Solution Directed Backjumping for QCSP -- Reformulating CSPs for Scalability with Application to Geospatial Reasoning -- A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects -- Local Symmetry Breaking During Search in CSPs -- Encodings of the Sequence Constraint -- On Inconsistent Clause-Subsets for Max-SAT Solving -- An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming -- Tradeoffs in the Complexity of Backdoor Detection -- Model-Driven Visualizations of Constraint-Based Local Search -- Dealing with Incomplete Preferences in Soft Constraint Problems -- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure -- MUST: Provide a Finer-Grained Explanation of Unsatisfiability -- An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search -- Limitations of Restricted Branching in Clause Learning -- Dynamic Management of Heuristics for Solving Structured CSPs -- A Compression Algorithm for Large Arity Extensional Constraints -- Valid Inequality Based Lower Bounds for WCSP -- Advisors for Incremental Propagation -- Breaking Symmetry of Interchangeable Variables and Values -- Path Consistency by Dual Consistency -- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance -- Scheduling Conditional Task Graphs -- Towards Robust CNF Encodings of Cardinality Constraints -- AND/OR Multi-valued Decision Diagrams for Constraint Optimization -- Parallelizing Constraint Programs Transparently -- MiniZinc: Towards a Standard CP Modelling Language -- Propagation = Lazy Clause Generation -- Boosting Probabilistic Choice Operators -- A Multi-engine Solver for Quantified Boolean Formulas -- Decomposing Global Grammar Constraints -- Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT -- Bound-Consistent Deviation Constraint -- Constructive Interval Disjunction -- An LP-Based Heuristic for Optimal Planning -- A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs -- On Universal Restart Strategies for Backtracking Search -- Hierarchical Hardness Models for SAT -- SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT -- Filtering for Subgraph Isomorphism -- Solution Counting Algorithms for Constraint-Centered Search Heuristics -- Min-Domain Ordering for Asynchronous Backtracking -- Short Research Papers -- Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario -- Uncertainty in Bipolar Preference Problems -- An Analysis of Slow Convergence in Interval Propagation -- The Expressive Power of Valued Constraints: Hierarchies and Collapses -- Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks -- The Log-Support Encoding of CSP into SAT -- Groupoids and Conditional Symmetry -- Sampling Strategies and Variable Selection in Weighted Degree Heuristics -- A Case for Simple SAT Solvers -- CP-Based Local Branching -- Strong Controllability of Disjunctive Temporal Problems with Uncertainty -- Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms -- Constraint Symmetry for the Soft CSP -- Breaking Value Symmetry. |
| Record Nr. | UNINA-9910483371203321 |
| Berlin ; ; New York, : Springer, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||