1431 search results - page 35 / 287 » Solving Constraints in Model Transformations |
112
Voted
MP
2002
15 years 4 days ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
122
click to vote
DAC
2003
ACM
16 years 1 months ago
2003
ACM
In the Artemis project [13], design space exploration of embedded systems is provided by modeling application behavior and architectural performance constraints separately. Mappin...
94
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
CP
2005
Springer
15 years 6 months ago
2005
Springer
There is no unified modeling standard available to the CP community, so constraint programs can not be developed independently from the used CP library. Without such standard, CP ...
101
click to vote
SARA
2009
Springer
15 years 7 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...