Sciweavers

4 search results - page 1 / 1
» Reasoning by Dominance in Not-Equals Binary Constraint Netwo...
Sort
View
153
Voted
CP
2006
Springer
15 years 7 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
126
Voted
AAAI
1992
15 years 4 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
124
Voted
CEC
2005
IEEE
15 years 5 months ago
Multi-objective optimisation of the pump scheduling problem using SPEA2
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
Manuel López-Ibáñez, T. Devi ...
133
Voted
DAC
1997
ACM
15 years 7 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao