1431 search results - page 21 / 287 » Solving Constraints in Model Transformations |
173
click to vote
CONSTRAINTS
2010
15 years 3 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
172
click to vote
ROBOCUP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Constraint Nets provide a semantic model for modeling hybrid dynamic systems. Controllers are embedded constraint solvers that solve constraints in real-time. A controlle...
178
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
We propose a computational model for analogy solving based on a topological formalism of representation. The source and the target analogs are represented as simplexes and the anal...
211
click to vote
DATESO
2009
15 years 4 months ago
2009
The Business Process Model represented as a diagram in Business Process Modeling Notation (BPMN) is a commonly used way how to describe business processes of an organization. Probl...
196
click to vote
ICAI
2010
15 years 4 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...