Sciweavers

109 search results - page 13 / 22
» General Symmetry Breaking Constraints
Sort
View
AMAI
2005
Springer
13 years 9 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
NORDICHI
2004
ACM
14 years 2 months ago
Breaking affordance: culture as context
The concept of affordance as it applies to user interface design is widely used and accepted; possibly overused. This paper explores one of the constraints on affordance: culture....
Lidia Oshlyansky, Harold W. Thimbleby, Paul A. Cai...
AI
2006
Springer
13 years 9 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
CPAIOR
2010
Springer
13 years 7 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
Justin Yip, Pascal Van Hentenryck, Carmen Gervet
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 7 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet