2974 search results - page 199 / 595 » Model-Driven Constraint Programming |
154
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
195
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
172
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...
280
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
142
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...