2974 search results - page 343 / 595 » Model-Driven Constraint Programming |
199
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
286
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
169
click to vote
ISCA
2009
IEEE
16 years 1 months ago
2009
IEEE
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
213
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
173
click to vote
ICSE
2010
IEEE-ACM
15 years 11 months ago
2010
IEEE-ACM
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...