Home > Computing and Information Technology > Computer programming / software engineering > Principles and Practice of Constraint Programming - CP 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings(5732 Lecture Notes in Computer Science)
37%
Principles and Practice of Constraint Programming - CP 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings(5732 Lecture Notes in Computer Science)

Principles and Practice of Constraint Programming - CP 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings(5732 Lecture Notes in Computer Science)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This volume contains the papers presented at CP 2009: The 15th International Conference on Principles and Practice of Constraint Programming. It was held from September 20–24, 2009 at the Rectory of the New University of Lisbon, Portugal. Everyone involved with the conference thanks our sponsors for their support. There were 128 submissions to the research track, of which 53 were accepted for a rate of 41.4%. Each submission was reviewed by three reviewers, with a small number of additional reviews obtained in exceptional cases. Each review waseitherbyaProgrammeCommitteemember,orbyacolleagueinvitedtohelp by a committee member thanks to their particular expertise. Papers submitted as long papers were accepted at full length or not at all. It is important to note that papers submitted as short papers were held to the same high standards of qualityas long papers. There is thus no distinction in these proceedings between long and short papers, except of course the number of pages they occupy. As it happens, the acceptancerates of short and long papers wereverysimilar indeed. Therewere13submissionstotheapplicationtrack,ofwhich8wereaccepted, fora rateof61.5%.Papersunderwentthe samereviewprocessasregularpapers, and there was not a separate committee for reviewing application track papers. However, papers in the application track were not required to be original or novel research, but to be original and novel as an application of constraints.

Table of Contents:
Invited Talks.- Constraint-Based Schedulers, Do They Really Work?.- Challenges for Constraint Reasoning and Optimization in Computational Sustainability.- Observations on Symmetry Breaking.- Application Track Papers.- Generating Optimal Stowage Plans for Container Vessel Bays.- Real-Time Tabu Search for Video Tracking Association.- Pin Assignment Using Stochastic Local Search Constraint Programming.- Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics.- Scheduling the CB1000 Nanoproteomic Analysis System with Python, Tailor, and Minion.- Solving Nurse Rostering Problems Using Soft Global Constraints.- Online Selection of Quorum Systems for RAMBO Reconfiguration.- A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem.- Research Track Papers.- Memoisation for Constraint-Based Local Search.- On the Structure of Industrial SAT Instances.- A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms.- Filtering Numerical CSPs Using Well-Constrained Subsystems.- Minimising Decision Tree Size as Combinatorial Optimisation.- Hull Consistency under Monotonicity.- A Constraint on the Number of Distinct Vectors with Application to Localization.- Approximating Weighted Max-SAT Problems by Compensating for Relaxations.- Confidence-Based Work Stealing in Parallel Constraint Programming.- Minimizing the Maximum Number of Open Stacks by Customer Search.- Using Relaxations in Maximum Density Still Life.- Constraint-Based Graph Matching.- Constraint Representations and Structural Tractability.- Asynchronous Inter-Level Forward-Checking for DisCSPs.- From Model-Checking to Temporal Logic Constraint Solving.- Exploiting Problem Structure for Solution Counting.- Solving a Location-Allocation Problem with Logic-Based Benders’ Decomposition.- Lazy Clause Generation Reengineered.- The Proper Treatment of Undefinedness in Constraint Languages.- Search Spaces for Min-Perturbation Repair.- Snake Lex: An Alternative to Double Lex.- Closing the Open Shop: Contradicting Conventional Wisdom.- Reasoning about Optimal Collections of Solutions.- Constraints of Difference and Equality: A Complete Taxonomic Characterisation.- Synthesizing Filtering Algorithms for Global Chance-Constraints.- An Interpolation Method for CLP Traversal.- Same-Relation Constraints.- Dialectic Search.- Restricted Global Grammar Constraints.- Conflict Resolution.- Propagator Groups.- Efficient Generic Search Heuristics within the EMBP Framework.- Failed Value Consistencies for Constraint Satisfaction.- A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations.- SOGgy Constraints: Soft Open Global Constraints.- Exploiting Problem Decomposition in Multi-objective Constraint Optimization.- Search Space Extraction.- Coalition Structure Generation Utilizing Compact Characteristic Function Representations.- Compiling All Possible Conflicts of a CSP.- On the Power of Clause-Learning SAT Solvers with Restarts.- Slice Encoding for Constraint-Based Planning.- Evolving Parameterised Policies for Stochastic Constraint Programming.- Maintaining State in Propagation Solvers.- Cost-Driven Interactive CSP with Constraint Relaxation.- Weakly Monotonic Propagators.- Constraint-Based Optimal Testing Using DNNF Graphs.- Why Cumulative Decomposition Is Not as Bad as It Sounds.- On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency.- Realtime Online Solving of Quantified CSPs.- Constraint-Based Local Search for the Automatic Generation of Architectural Tests.- Edge FindingFiltering Algorithm for Discrete Cumulative Resources in .- Evaluation of Length-Lex Set Variables.- The Complexity of Valued Constraint Models.


Best Sellers


Product Details
  • ISBN-13: 9783642042430
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Depth: 32
  • Height: 235 mm
  • No of Pages: 844
  • Series Title: 5732 Lecture Notes in Computer Science
  • Spine Width: 33 mm
  • Weight: 1246 gr
  • ISBN-10: 3642042430
  • Publisher Date: 07 Sep 2009
  • Binding: Paperback
  • Edition: 1
  • Language: English
  • Returnable: Y
  • Series Title: Programming and Software Engineering
  • Sub Title: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Principles and Practice of Constraint Programming - CP 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings(5732 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Principles and Practice of Constraint Programming - CP 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings(5732 Lecture Notes in Computer Science)
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 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings(5732 Lecture Notes in Computer Science)

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!
    ASK VIDYA