4117 search results - page 290 / 824 » On the Satisfiability of Complex Constraints |
227
click to vote
SIAMDM
2010
15 years 5 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
193
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
163
Voted
DICTA
2003
15 years 8 months ago
2003
Abstract. Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S3 group, it’s hard to specify meaningful joint cons...
129
click to vote
ECAL
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
174
click to vote
AIPS
2009
15 years 8 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...