4117 search results - page 629 / 824 » On the Satisfiability of Complex Constraints |
169
click to vote
AIPS
1994
15 years 8 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
167
click to vote
WCE
2007
15 years 7 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
145
click to vote
WCE
2007
15 years 7 months ago
2007
—The research efforts of the DECIDE Research Group have resulted in a decision tool capable of handling imprecise information in complex decision situations. Some of the research...
194
click to vote
BIRTHDAY
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the con...
169
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...