Cantitate/Preț
Produs
Total produse
Vezi coșul
Principles and Practice of Constraint Programming: 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008, Proceedings de Peter J. Stuckey

Principles and Practice of Constraint Programming: 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008, Proceedings: Lecture Notes in Computer Science, cartea 5202

Editat de Peter J. Stuckey
en Limba Engleză Paperback – 28 aug 2008

Destinat cercetătorilor și inginerilor software specializați în optimizare, Principles and Practice of Constraint Programming documentează progresele fundamentale prezentate la conferința CP 2008 din Sydney. Observăm aici o structură riguroasă care separă contribuțiile teoretice de implementările practice, oferind o imagine de ansamblu asupra stadiului tehnologiei la acel moment. Volumul reflectă maturitatea domeniului, fiind organizat în jurul a două direcții principale: cercetarea fundamentală și aplicațiile industriale.

Descoperim în secțiunea de aplicații studii de caz complexe, de la alocarea și programarea resurselor pe arhitecturi de calcul paralele, până la optimizarea rețelelor de transport petrolier. Aceste exemple concrete demonstrează flexibilitatea programării prin constrângeri în rezolvarea problemelor NP-dure. În paralel, secțiunea de cercetare explorează optimizarea reducerilor tabulare, propagatori bazați pe fluxuri pentru constrângeri globale și algoritmi de tip Branch and Bound.

Editorul Peter J. Stuckey poziționează acest volum în continuarea preocupărilor sale constante pentru logica computațională și optimizare. Dacă în Integration of Constraint Programming, Artificial Intelligence, and Operations Research accentul este pus pe hibridizarea metodelor, iar în Logic Programming pe fundamentele limbajelor de programare, volumul de față acționează ca o punte între teorie și execuție tehnică. Subliniem rigoarea procesului de selecție, unde fiecare lucrare a trecut printr-un sistem de evaluare multiplă, asigurând o valoare științifică ridicată pentru arhitecții de sisteme care utilizează Programming and Software Engineering.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 74863 lei

Preț vechi: 93579 lei
-20%

Puncte Express: 1123

Carte disponibilă

Livrare economică 02-16 iunie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540859574
ISBN-10: 3540859578
Pagini: 665
Ilustrații: XVII, 648 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.95 kg
Ediția:2008
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ă

Research

De ce să citești această carte

Pentru cercetătorii din domeniul informaticii, această lucrare oferă acces la metodologii avansate de rezolvare a problemelor de optimizare. Cititorul câștigă o înțelegere profundă a algoritmilor de căutare și a tehnicilor de modelare a constrângerilor, aplicabile în domenii diverse precum bioinformatica, telecomunicațiile și planificarea industrială. Este o resursă esențială pentru cei care doresc să stăpânească instrumentele matematice din spatele sistemelor decizionale complexe.

Descriere scurtă

This volume contains the proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008) held in Sydney, Australia, September 14–18, 2008. The conference was held in conjunction with the International Conference on Automated Planning and Scheduling (ICAPS 2008) and the International Conference on Knowledge Representation and R- soning (KR 2008). Information about the conference can be found at the w- sitehttp://www. unimelb. edu. au/cp2008/. Held annually, the CP conference series is the premier international conference on constraint programming. The conference focuses on all aspects of computing with constraints. The CP conf- ence series is organized by the Association for Constraint Programming (ACP). Information about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about ACP can be found athttp://www. a4cp. org/. CP 2008 included two calls for contributions: a call for research papers, - scribing novel contributions in the ?eld, and a call for application papers, - scribing applications of constraint technology. For the ?rst time authors could directly submit short papers for consideration by the committee. The research track received 84 long submissions and 21 short submissions and the application track received 15 long submissions. Each paper received at least three reviews, which the authors had the opportunity to see and to react to, before the papers and their reviews were discussed extensively by the members of the Program Committee.

Cuprins

Invited Lecture.- Back to the Complexity of Universal Programs.- Applications Track Long Papers.- A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine.- Planning and Scheduling the Operation of a Very Large Oil Pipeline Network.- Search Strategies for Rectangle Packing.- Solving a Telecommunications Feature Subscription Configuration Problem.- Protein Structure Prediction with Large Neighborhood Constraint Programming Search.- An Application of Constraint Programming to Superblock Instruction Scheduling.- Research Track Long Papers.- Classes of Submodular Constraints Expressible by Graph Cuts.- Optimization of Simple Tabular Reduction for Table Constraints.- Universal Booleanization of Constraint Models.- Flow-Based Propagators for the SEQUENCE and Related Global Constraints.- Guiding Search in QCSP?+? with Back-Propagation.- A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions.- A Branch and Bound Algorithm for Numerical MAX-CSP.- A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules.- Cost-Based Domain Filtering for Stochastic Constraint Programming.- Dichotomic Search Protocols for Constrained Optimization.- Length-Lex Bounds Consistency for Knapsack Constraints.- A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems.- From High Girth Graphs to Hard Instances.- Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT.- CPBPV: A Constraint-Programming Framework for Bounded Program Verification.- Exploiting Common Subexpressions in Numerical CSPs.- A Soft Constraint of Equality: Complexity and Approximability.- Structural Tractability of Propagated Constraints.- Connecting ABTwith Arc Consistency.- Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies.- Reformulating Positive Table Constraints Using Functional Dependencies.- Relaxations for Compiled Over-Constrained Problems.- Approximate Compilation of Constraints into Multivalued Decision Diagrams.- Quantified Constraint Optimization.- Exploiting Decomposition in Constraint Optimization Problems.- A Coinduction Rule for Entailment of Recursively Defined Properties.- Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints.- Research Track Short Papers.- Perfect Constraints Are Tractable.- Efficiently Solving Problems Where the Solutions Form a Group.- Approximate Solution Sampling (and Counting) on AND/OR Spaces.- Model Restarts for Structural Symmetry Breaking.- An Elimination Algorithm for Functional Constraints.- Crossword Puzzles as a Constraint Problem.- Recent Hybrid Techniques for the Multi-Knapsack Problem.- Edge Matching Puzzles as Hard SAT/CSP Benchmarks.- Test Strategy Generation Using Quantified CSPs.- Perfect Derived Propagators.- Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems.- Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation.- Semi-automatic Generation of CHR Solvers for Global Constraints.- Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions.- Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm.- Computing All Optimal Solutions in Satisfiability Problems with Preferences.- On the Efficiency of Impact Based Heuristics.- Probabilistically Estimating Backbones and Variable Bias: Experimental Overview.- A New Empirical Study of Weak Backdoors.- Adding Search to Zinc.- Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms.- Search Space Reduction for Constraint Optimization Problems.- Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 14th International Conference on Principles and Practice of Constraint Programming, CP 2008, Sydney, Australia, September, 2008.
The 27 revised full papers and 23 revised short papers presented together with 6 application papers and the abstracts of one invited lecture were carefully reviewed and selected from 120 submissions. All current issues of computing with constraints are addressed, ranging from methodological and foundational aspects - using algorithms, environments, languages, models and systems - to solving real-world problems in various application fields.