the work presented in this talk deals withthe management of a drinking water distribution network in terms of planning the use of different installations (treatment works, pumping stations, and valves) in order to co...
详细信息
High-performance Computing (HPC) systems have become essential instruments in our modern society. As they get closer to exascale performance, HPC systems become larger in size and more heterogeneous in their computing...
详细信息
A binary constraint tree (BCT, Wang and Yap 2022) is a normalized binary CSP whose constraint graph is a tree. A BCT constraint is a constraint represented with a BCT where some of the variables may be hidden (i.e. ex...
详细信息
Feature Terms are a generalization of first-order terms which have been recently received increased attention for their usefulness in structured machine learning applications. One of the main obstacles for their wide ...
详细信息
Pseudo-Boolean proof logging has been used successfully to provide certificates of optimality from a variety of constraint- and satisifability-style solvers that combine reasoning with a backtracking or clause-learnin...
详细信息
this volume contains the papers presented at CP 2009: the 15thinternationalconference on principles and practice of constraintprogramming. It was held from September 20–24, 2009 at the Rectory of the New Universit...
详细信息
ISBN:
(数字)9783642042447
ISBN:
(纸本)9783642042430
this volume contains the papers presented at CP 2009: the 15thinternationalconference on principles and practice of constraintprogramming. It was held from September 20–24, 2009 at the Rectory of the New University of Lisbon, Portugal. Everyone involved withthe conferencethanks 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.
We introduce a novel approach for symmetry breaking by dominance detection (SBDD). the essence of SBDD is to perform ‘dominance checks’ at each node in a search tree to ensure that no symmetrically equivalent node h...
详细信息
Dominance breaking is an effective technique to reduce the time for solving constraint optimization problems. Lee and Zhong propose an automatic dominance breaking framework for a class of constraint optimization prob...
详细信息
In this paper we describe a constraint Seeker application which provides a web interface to search for global constraints in the global constraint catalog, given positive and negative, fully instantiated (ground) exam...
详细信息
In recent years, many constraint-specific filtering algorithms have been introduced. Such algorithms use the semantics of the constraint to perform filtering more efficiently than a generic algorithm. the usefulness o...
详细信息
暂无评论