000 06150nam a22006015i 4500
001 978-3-540-46268-2
003 DE-He213
005 20240730192848.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540462682
_9978-3-540-46268-2
024 7 _a10.1007/11889205
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aPrinciples and Practice of Constraint Programming - CP 2006
_h[electronic resource] :
_b12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings /
_cedited by Frédéric Benhamou.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXVIII, 774 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4204
505 0 _aInvited Papers -- Global Optimization of Probabilistically Constrained Linear Programs -- Algorithms and Constraint Programming -- Interval Analysis and Robotics -- Constraint Based Resilience Analysis -- Regular Papers -- Infinite Qualitative Simulations by Means of Constraint Programming -- Algorithms for Stochastic CSPs -- Graph Properties Based Filtering -- The ROOTS Constraint -- CoJava: Optimization Modeling by Nondeterministic Simulation -- An Algebraic Characterisation of Complexity for Valued Constraint -- Typed Guarded Decompositions for Constraint Satisfaction -- Propagation in CSP and SAT -- The Minimum Spanning Tree Constraint -- Impact of Censored Sampling on the Performance of Restart Strategies -- Watched Literals for Constraint Propagation in Minion -- Inner and Outer Approximations of Existentially Quantified Equality Constraints -- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms -- Adaptive Clause Weight Redistribution -- Localization of an Underwater Robot Using Interval Constraint Propagation -- Approximability of Integer Programming with Generalised Constraints -- When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages -- Generalized Arc Consistency for Positive Table Constraints -- Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs -- Boosting Open CSPs -- Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs) -- Distributed Constraint-Based Local Search -- High-Level Nondeterministic Abstractions in C++ -- A Structural Characterization of Temporal Dynamic Controllability -- When Interval Analysis Helps Inter-block Backtracking -- Randomization in Constraint Programming for Airline Planning -- Towards an Efficient SATEncoding for Temporal Reasoning -- Decomposition of Multi-operator Queries on Semiring-Based Graphical Models -- Dynamic Lex Constraints -- Generalizing AllDifferent: The SomeDifferent Constraint -- Mini-bucket Elimination with Bucket Propagation -- Constraint Satisfaction with Bounded Treewidth Revisited -- Preprocessing QBF -- The Theory of Grammar Constraints -- Constraint Programming Models for Graceful Graphs -- A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem -- Generating Propagators for Finite Set Constraints -- Compiling Finite Linear CSP into SAT -- Differentiable Invariants -- Revisiting the Sequence Constraint -- BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs -- General Symmetry Breaking Constraints -- Poster Papers -- Inferring Variable Conflicts for Local Search -- Reasoning by Dominance in Not-Equals Binary Constraint Networks -- Distributed Stable Matching Problems with Ties and Incomplete Lists -- Soft Arc Consistency Applied to Optimal Planning -- A Note on Low Autocorrelation Binary Sequences -- Relaxations and Explanations for Quantified Constraint Satisfaction Problems -- Static and Dynamic Structural Symmetry Breaking -- The Modelling Language Zinc -- A Filter for the Circuit Constraint -- A New Algorithm for Sampling CSP Solutions Uniformly at Random -- Sports League Scheduling: Enumerative Search for Prob026 from CSPLib -- Dynamic Symmetry Breaking Restarted -- The Effect of Constraint Representation on Structural Tractability -- Failure Analysis in Backtrack Search for Constraint Satisfaction -- Heavy-Tailed Runtime Distributions: Heuristics, Models and Optimal Refutations -- An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP -- Clique Inference Process for Solving Max-CSP -- Global Grammar Constraints -- Constraint Propagation for Domain Bounding in Distributed Task Scheduling -- Interactive Distributed Configuration -- Retroactive Ordering for Dynamic Backtracking.
650 0 _aSoftware engineering.
_94138
650 0 _aComputer programming.
_94169
650 0 _aCompilers (Computer programs).
_93350
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9151551
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aProgramming Techniques.
_9151552
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9151553
700 1 _aBenhamou, Frédéric.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151554
710 2 _aSpringerLink (Online service)
_9151555
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540462675
776 0 8 _iPrinted edition:
_z9783540831266
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4204
_9151556
856 4 0 _uhttps://doi.org/10.1007/11889205
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94472
_d94472