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

Front Cover
Springer Science & Business Media, Aug 26, 2002 - Computers - 794 pages
0 Reviews
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.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Technical Papers
1
Integrating Constraint and Integer Programming
17
On Optimal Correction of Inconsistent Linear Constraints
33
A New Multiresource cumulatives Constraint with Negative Heights
63
Relaxation and Applications
80
Global Constraints for Lexicographic Orderings
93
A Global Filtering Algorithm for Handling Systems
109
Amplification of Search Performance
124
Distributed ConstraintBased Railway Simulation
762
A Linear Programming Based Satisfiability Solver
775
Partial Symmetry Breaking
782
Robust Classification Through the Forward Search
3
Interaction Terms in Nonlinear PLS via Additive Spline
22
Efficient Density Clustering Using Basin Spanning Trees 39
39
Scalable Clustering of High Dimensional Data 57
57
CoreBased Clustering Techniques 74
74

Computing the Envelope for StepwiseConstant Resource Allocations
139
Local Probing Applied to Scheduling
155
A Hybrid Approach for SAT
172
Djamal Habet Chu Min Li Laure Devendeville and Michel Vasquez
185
Towards a Symmetric Treatment of Satisfaction and Conflicts
200
Accelerating Random Walks
216
Opportunistic Specialization in Russian Doll Search
264
RangeBased Algorithm for MaxCSP
280
Resolution Complexity of Random Constraints
295
Constraint Satisfaction Bounded Treewidth and FiniteVariable Logics
310
Determining the Number of Solutions to Binary CSP Instances
327
Consistency Checking for Qualitative Spatial Reasoning
341
Open Constraint Satisfaction
356
ArcConsistency for Quantified Constraints
371
Posters
386
A Dual Graph Translation of a Problem in Life
402
Symmetry Breaking during Search
415
Partial Symmetry Breaking
431
Symmetry Breaking Revisited
446
Breaking Row and Column Symmetries in Matrix Models
462
Pierre Flener Alan M Frisch Brahim Hnich Zeynep Kiziltan
477
Inferring Constraint Types in Constraint Programming
492
Controlling Embedded Systems
508
The Adaptive Constraint Engine
525
IndexicalBased Solver Learning
541
The Case
556
Kevin Ley tonBrown Eugene Nudelman and Yoav Shoham
573
Innovative Applications
587
Modeling Camera Control with Constrained Hypertubes
618
Robust and Parallel Solving of a Network Design Problem
633
Muriel Lauvergne Philippe David and Patrice Boizumault
664
with Equality and Disequality Constraints
680
A Relational Constraint Solver for ModelBased Engineering
696
Criticality and Parallelism in Structured SAT Instances
714
Stefano Bistarelli Boi Fallings and Nicoleta Neagu
732
Algebraic Properties of CSP Model Operators
750
Implementing a new Method for Discriminant Analysis
92
Improving the Classification Performance of a Discriminant
109
Cluster and Discriminant Analysis With Both Metric
127
Maximizing
143
A Bayesian Approach for the Estimation of the Covariance
165
Some Applications of TimeVarying Coefficient Models
182
A Dimensionality Reduction Method Based on Simple Linear
201
Principal Component Analysis of Boolean Symbolic Objects 218
218
How Wrong Models Become Useful and Correct Models
235
LBGUEM Algorithm for Mixture Density Estimation 252
252
Compare and Contrast 270
270
New Graphical Symbolic Objects Representations in Parallel
288
Prediction Optimal Data Analysis by Means of Stochastic
305
The
321
Some Statistical Issues in Microarray Data Analysis 337
337
Neural Budget Networks of Sensorial Data 369
369
Extreme Datamining 387
387
Analyzing Learner Behavior and Performance 405
405
Comparing Simple AssociationRules and RepeatBuying Based
421
The so far Missing Link UserFriendly
438
Vector Quantization in Learning
456
Syntagmatic and Paradigmatic Associations in Information
473
Internet Thesaurus Extracting Relevant Terms from
492
Simulated Annealing and Tabu Search for Optimization
510
Multimedia Stimulus Presentation Methods for Conjoint
530
Estimation of Default Probabilities in a SingleFactor Model 546
546
Simultaneous Confidence Intervals for Default Probabilities 555
555
Classification of Multivariate Data With Missing Values
570
Developing a Layout of a Supermarket Through Asymmetric
587
Comparing
604
I Textual
624
Power Functions in Multiple Sampling Plans Using
643
Methodological Issues in the Baffling Relationship
652
Efficient Clustering Methods for Tumor Classification With
670
Index 689
689
Copyright

Common terms and phrases

Popular passages

Page 5 - AP is the graph theory problem of finding a set of disjoint subtours such that all the vertices in V are visited and the overall cost is a minimum.

About the author (2002)

Pascal Van Hentenryck is Professor in the Department of Computer Science at Brown University. He is the author or editor of several MIT Press books.

Bibliographic information