约束程序设计原理与实践 CP2002Principles and practice of constraint programming-CP2002
点此进入淘宝搜索页搜索分类: 图书,计算机/网络,程序设计,其他,
作者： Pascal Van Hentenryck 著
出 版 社： 湖南文艺出版社
出版时间： 2002-12-1字数：版次： 1页数： 794印刷时间： 2002/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540441205包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)
内容简介
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.
目录
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 eumulatives 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
Olli Kamarainen and Hani E1 Sakkout
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 Symmetry Breaking
Symmetry Breaking Revisited
……
Innovative Applications
Doctoral Program
Author Index
