4117 search results - page 83 / 824 » On the Satisfiability of Complex Constraints |
177
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
154
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Power-aware systems are those that must make the best use of available power. They subsume traditional low-power systems in that they must not only minimize power when the budget ...
175
click to vote
FOIKS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
186
click to vote
CAISE
2006
Springer
15 years 8 months ago
2006
Springer
Given a service request such as scheduling an appointment or purchasing a product, it is possible that the invocation of the service results in too many solutions that all satisfy ...
156
click to vote
COCO
2007
Springer
16 years 15 days ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...