Treffer: sPREAD : A balancing constraint based on statistics

Title:
sPREAD : A balancing constraint based on statistics
Source:
Principles and practice of constraint programming - CP 2005 (11th international conference, CP 2005, Sitges, Spain, October 1-5, 2005, proceedings)Lecture notes in computer science. :460-474
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 4 ref 1
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
ILOG, 1681 route des Dolines, 06560 Valbonne, France
Computing and Information Science, Cornell University, Ithaca NY 14850, United States
ISSN:
0302-9743
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17324960
Database:
PASCAL Archive

Weitere Informationen

Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to specifically address this issue, particularly at the modeling level. We propose a new constraint dedicated to balancing, based on well-known and well-understood concepts in statistics. We show how it can be used to model different situations in which balance is important. We also design efficient filtering algorithms to guide the search towards balanced solutions.