Principles and Practice of Constraint Programming - CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 25-29, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4741
Editat de Christian Bessiereen Limba Engleză Paperback – 6 sep 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 675.63 lei
Preț vechi: 844.55 lei
-20% Nou
Puncte Express: 1013
Preț estimativ în valută:
129.30€ • 134.82$ • 107.46£
129.30€ • 134.82$ • 107.46£
Carte tipărită la comandă
Livrare economică 21 martie-04 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540749691
ISBN-10: 3540749691
Pagini: 910
Ilustrații: XV, 887 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 1.25 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540749691
Pagini: 910
Ilustrații: XV, 887 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 1.25 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.