1431 search results - page 141 / 287 » Solving Constraints in Model Transformations |
110
Voted
SOSYM
2008
15 years 21 days ago
2008
Abstract. The Meta Object Facility (MOF) 2.0 and the Unified Modeling Language Infrastructure introduce new language features such as subsets, (derived) unions and redefinitions, b...
111
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We present a new approach to the general problem of template-based segmentation, detection, and registration. This joint problem is highly nonlinear and high dimensional, due to t...
109
click to vote
QUESTA
2006
15 years 21 days ago
2006
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
121
click to vote
CONSTRAINTS
2007
15 years 23 days ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
113
click to vote
AIMSA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....