1431 search results - page 110 / 287 » Solving Constraints in Model Transformations |
133
click to vote
CASES
2004
ACM
15 years 10 months ago
2004
ACM
Application specific processors offer the potential of rapidly designed logic specifically constructed to meet the performance and area demands of the task at hand. Recently, t...
115
click to vote
ISCAS
2002
IEEE
15 years 9 months ago
2002
IEEE
A unified, closed form analytical drain current model for partially and fully depleted SOS MOSFETs was investigated. The analytical model was developed using first order principle...
EMNLP
2008
15 years 5 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
111
click to vote
TSP
2010
14 years 11 months ago
2010
A power allocation or scheduling problem is studied for a multiuser multiple-input multiple-output (MIMO) wireless relay system where there is a non-regenerative relay between one ...
139
click to vote
IJCAI
2003
15 years 5 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...