|
|
|
|
LEADER |
05932nam a22005655i 4500 |
001 |
978-3-540-46268-2 |
003 |
DE-He213 |
005 |
20151204183533.0 |
007 |
cr nn 008mamaa |
008 |
100301s2006 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540462682
|9 978-3-540-46268-2
|
024 |
7 |
|
|a 10.1007/11889205
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.758
|
072 |
|
7 |
|a UMZ
|2 bicssc
|
072 |
|
7 |
|a UL
|2 bicssc
|
072 |
|
7 |
|a COM051230
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
245 |
1 |
0 |
|a Principles and Practice of Constraint Programming - CP 2006
|h [electronic resource] :
|b 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006. Proceedings /
|c edited by Frédéric Benhamou.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
300 |
|
|
|a XVIII, 774 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4204
|
505 |
0 |
|
|a Invited 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 SAT Encoding 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 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
650 |
2 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
700 |
1 |
|
|a Benhamou, Frédéric.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540462675
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4204
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11889205
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|