Principles and Practice of Constraint Programming - CP 2002
Home > Computing and Information Technology > Computer programming / software engineering > Principles and Practice of Constraint Programming - CP 2002: 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings
Principles and Practice of Constraint Programming - CP 2002: 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings

Principles and Practice of Constraint Programming - CP 2002: 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

This book constitutes the refereed proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, CP 2002, held in Ithaca, NY, USA in September 2002. The 38 revised full papers and 6 innovative application papers as well as the 14 short papers presented toghether with 25 abstracts from contributions to the doctoral program were carefully reviewed and selected from 146 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to application in various fields.

Table of Contents:
Technical Papers.- Reduced Cost-Based Ranking for Generating Promising Subproblems.- Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem.- On Optimal Correction of Inconsistent Linear Constraints.- Temporal Planning through Mixed Integer Programming: A Preliminary Report.- A New Multi-resource cumulatives Constraint with Negative Heights.- On the Sum Constraint: Relaxation and Applications.- Global Constraints for Lexicographic Orderings.- A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations.- Amplification of Search Performance through Randomization of Heuristics.- Computing the Envelope for Stepwise-Constant Resource Allocations.- Local Probing Applied to Scheduling.- A Hybrid Approach for SAT.- Recovering and Exploiting Structural Knowledge from CNF Formulas.- Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation.- Accelerating Random Walks.- Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT.- Learning and Solving Soft Temporal Constraints: An Experimental Study.- Opportunistic Specialization in Russian Doll Search.- Range-Based Algorithm for Max-CSP.- Resolution Complexity of Random Constraints.- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics.- Determining the Number of Solutions to Binary CSP Instances.- Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions.- Open Constraint Satisfaction.- Beyond NP: Arc-Consistency for Quantified Constraints.- Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information.- A Dual Graph Translation of a Problem in ‘Life’.- Groups and Constraints: Symmetry Breaking during Search.- Partial SymmetryBreaking.- Symmetry Breaking Revisited.- Breaking Row and Column Symmetries in Matrix Models.- Solving the Kirkman’s Schoolgirl Problem in a Few Seconds.- Inferring Constraint Types in Constraint Programming.- Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden State.- The Adaptive Constraint Engine.- Indexical-Based Solver Learning.- Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions.- Restart Policies with Dependence among Runs: A Dynamic Programming Approach.- Innovative Application.- Visopt ShopFloor: On the Edge of Planning and Scheduling.- Constraint Programming Contribution to Benders Decomposition: A Case Study.- Modeling Camera Control with Constrained Hypertubes.- Robust and Parallel Solving of a Network Design Problem.- Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints.- Communication and Computation in Distributed CSP Algorithms.- Posters.- Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints.- A Relaxation of the Cumulative Constraint.- Improving GSAT Using 2SAT.- A Relational Constraint Solver for Model-Based Engineering.- Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems.- Scaling Properties of Pure Random Walk on Random 3-SAT.- Criticality and Parallelism in Structured SAT Instances.- Characterizing SAT Problems with the Row Convexity Property.- Interchangeability in Soft CSPs.- On Constraint Problems with Incomplete or Erroneous Data.- Heuristic Constraint Propagation.- An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint.- Algebraic Properties of CSP Model Operators.- AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity.- DoctoralProgram.- Integrating Search Objects in Asynchronous Constraint Solving.- Distributed Constraint-Based Railway Simulation.- Symmetry Breaking in Peaceably Coexisting Armies of Queens.- Batch Processing with Sequence Dependent Setup Times.- Interactive Heuristic Search Algorithm.- On Constraint Problems with Incomplete or Erroneous Data.- Design of a New Metaheuristic for MAXSAT Problems.- Disjunctive and Continuous Constraint Satisfaction Problems.- Tuning Randomization in Backtrack Search SAT Algorithms.- Constraint Solving in Test-Data Generation.- Improving Cost Calculations for Global Constraints in Local Search.- A Modeling Framework for Constraints.- A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design.- A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles.- Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling.- Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems.- A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form.- Models of Injection Problems.- Partial Symmetry Breaking.- Automatic Generation of Implied Clauses for SAT.- Bridging the Gap between SAT and CSP.- Reducing Symmetry in Matrix Models.- Studying Interchangeability in Constraint Satisfaction Problems.- Constraint Modeling in the Context of Academic Task Assignment.- Design Tradeoffs for Autonomous Trading Agents.


Best Sellers


Product Details
  • ISBN-13: 9783540441205
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 794
  • Returnable: N
  • Width: 155 mm
  • ISBN-10: 3540441204
  • Publisher Date: 26 Aug 2002
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Principles and Practice of Constraint Programming - CP 2002: 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Principles and Practice of Constraint Programming - CP 2002: 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Principles and Practice of Constraint Programming - CP 2002: 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!